Attributes | Values |
---|
rdf:type
| |
Description
| - We say that a graph with n vertices is c-Ramsey if it does not contain either a clique or an independent set of size c logn. We define a CNF formula which expresses this property for a graph G. We show a superpolynomial lower bound on the length of resolution proofs that G is c-Ramsey, for every graph G. Our proof makes use of the fact that every Ramsey graph must contain a large subgraph with some of the statistical properties of the random graph.
- We say that a graph with n vertices is c-Ramsey if it does not contain either a clique or an independent set of size c logn. We define a CNF formula which expresses this property for a graph G. We show a superpolynomial lower bound on the length of resolution proofs that G is c-Ramsey, for every graph G. Our proof makes use of the fact that every Ramsey graph must contain a large subgraph with some of the statistical properties of the random graph. (en)
|
Title
| - The complexity of proving that a graph is Ramsey
- The complexity of proving that a graph is Ramsey (en)
|
skos:prefLabel
| - The complexity of proving that a graph is Ramsey
- The complexity of proving that a graph is Ramsey (en)
|
skos:notation
| - RIV/67985840:_____/13:00395529!RIV14-GA0-67985840
|
http://linked.open...avai/riv/aktivita
| |
http://linked.open...avai/riv/aktivity
| - I, P(GBP202/12/G061), P(IAA100190902)
|
http://linked.open...vai/riv/dodaniDat
| |
http://linked.open...aciTvurceVysledku
| |
http://linked.open.../riv/druhVysledku
| |
http://linked.open...iv/duvernostUdaju
| |
http://linked.open...titaPredkladatele
| |
http://linked.open...dnocenehoVysledku
| |
http://linked.open...ai/riv/idVysledku
| - RIV/67985840:_____/13:00395529
|
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - CNF formulas; independent set; lower bounds (en)
|
http://linked.open.../riv/klicoveSlovo
| |
http://linked.open...ontrolniKodProRIV
| |
http://linked.open...v/mistoKonaniAkce
| |
http://linked.open...i/riv/mistoVydani
| |
http://linked.open...i/riv/nazevZdroje
| - Automata, Languages, and Programming. Part I
|
http://linked.open...in/vavai/riv/obor
| |
http://linked.open...ichTvurcuVysledku
| |
http://linked.open...cetTvurcuVysledku
| |
http://linked.open...vavai/riv/projekt
| |
http://linked.open...UplatneniVysledku
| |
http://linked.open...iv/tvurceVysledku
| - Thapen, Neil
- Pudlák, Pavel
- Lauria, M.
- Rödl, V.
|
http://linked.open...vavai/riv/typAkce
| |
http://linked.open.../riv/zahajeniAkce
| |
number of pages
| |
http://bibframe.org/vocab/doi
| - 10.1007/978-3-642-39206-1_58
|
http://purl.org/ne...btex#hasPublisher
| |
https://schema.org/isbn
| |