Add to ORKGWe 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 log n. 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 consider a class of graphs on n vertices, called (d, f)-arrangeable graphs. This class of graphs ...
Ramsey's Theorem is a cornerstone of combinatorics and logic. In its simplest formulation it says th...
The cube graph Q_n is the skeleton of the n-dimensional cube. It is an n-regular graph on 2^n vertic...
Abstract. We say that a graph with n vertices is c-Ramsey if it does not contain either a clique or ...
We say that a graph with n vertices is c-Ramsey if it does not contain either a clique or an indepen...
An n-vertex graph G is c-Ramsey if it contains neither a complete nor an empty induced subgraph of s...
The Ramsey number R(F, H) is the minimum number N such that any N-vertex graph either contains a cop...
An n-vertex graph is called C-Ramsey if it has no clique or independent set of size Clog2n (i.e., if...
We study the following question raised by Erdos and Hajnal in the early 90's. Over all n-vertex grap...
This BCs thesis deals with topics from graph theory. Ramsey theory in its most basic form deals with...
The cube graph Qn is the skeleton of the n-dimensional cube. It is an n-regular graph on 2n vertices...
The cube graph Q_n is the skeleton of the n-dimensional cube. It is an n-regular graph on 2^n vertic...
The cube graph Q[subscript n] is the skeleton of the n-dimensional cube. It is an n-regular graph on...
Let Q(n, χ) denote the minimum clique size an n-vertex graph can have if its chromatic number is χ. ...
We consider a class of graphs on n vertices, called (d, f)-arrangeable graphs. This class of graphs ...
We consider a class of graphs on n vertices, called (d, f)-arrangeable graphs. This class of graphs ...
Ramsey's Theorem is a cornerstone of combinatorics and logic. In its simplest formulation it says th...
The cube graph Q_n is the skeleton of the n-dimensional cube. It is an n-regular graph on 2^n vertic...
Abstract. We say that a graph with n vertices is c-Ramsey if it does not contain either a clique or ...
We say that a graph with n vertices is c-Ramsey if it does not contain either a clique or an indepen...
An n-vertex graph G is c-Ramsey if it contains neither a complete nor an empty induced subgraph of s...
The Ramsey number R(F, H) is the minimum number N such that any N-vertex graph either contains a cop...
An n-vertex graph is called C-Ramsey if it has no clique or independent set of size Clog2n (i.e., if...
We study the following question raised by Erdos and Hajnal in the early 90's. Over all n-vertex grap...
This BCs thesis deals with topics from graph theory. Ramsey theory in its most basic form deals with...
The cube graph Qn is the skeleton of the n-dimensional cube. It is an n-regular graph on 2n vertices...
The cube graph Q_n is the skeleton of the n-dimensional cube. It is an n-regular graph on 2^n vertic...
The cube graph Q[subscript n] is the skeleton of the n-dimensional cube. It is an n-regular graph on...
Let Q(n, χ) denote the minimum clique size an n-vertex graph can have if its chromatic number is χ. ...
We consider a class of graphs on n vertices, called (d, f)-arrangeable graphs. This class of graphs ...
We consider a class of graphs on n vertices, called (d, f)-arrangeable graphs. This class of graphs ...
Ramsey's Theorem is a cornerstone of combinatorics and logic. In its simplest formulation it says th...
The cube graph Q_n is the skeleton of the n-dimensional cube. It is an n-regular graph on 2^n vertic...