AbstractAn induced subgraph is called homogeneous if it is either a clique or an independent set. Let hom(G) denote the size of the largest homogeneous subgraph of a graph G. In this short paper we study properties of graphs on n vertices with hom(G)⩽Clogn for some constant C. We show that every such graph contains an induced subgraph of order αn in which βn vertices have different degrees, where α and β depend only on C. This proves a conjecture of Erdős, Faudree and Sós
We call a graph H Ramsey-unsaturated if there is an edge in the complement of H such that the Ramsey...
AbstractIn this paper we will consider Ramsey-type problems for finite graphs, r-partitions and hype...
We call a graph H Ramsey-unsaturated if there is an edge in the complement of H such that the Ramsey...
AbstractAn induced subgraph is called homogeneous if it is either a clique or an independent set. Le...
An n-vertex graph G is c-Ramsey if it contains neither a complete nor an empty induced subgraph of s...
We consider the variation of Ramsey numbers introduced by Erdős and Pach [J. Graph Theory, 7 (1983)...
AbstractLet F be a graph of order v(F)≥3 and size e(F), and let ρ(F)=(e(F)−1)/(v(F)−2). It is shown ...
We consider a variation of Ramsey numbers introduced by Erdős and Pach [6], where instead of seeking...
We consider the variation of Ramsey numbers introduced by Erdös and Pach [J. Graph Theory, 7 (1983),...
We consider the variation of Ramsey numbers introduced by Erdos and Pach [J. Graph Theory, 7 (1983),...
AbstractThe following theorem is proved: Let G be a finite graph with cl(G) = m, where cl(G) is the ...
A graph with many vertices cannot be homogeneous, i.e., for any pair of integers (i,j) all large gra...
AbstractIn this paper we will consider Ramsey-type problems for finite graphs, r-partitions and hype...
We use techniques of logic, particularly set theory, to determine upper bounds on the big Ramsey deg...
We use techniques of logic, particularly set theory, to determine upper bounds on the big Ramsey deg...
We call a graph H Ramsey-unsaturated if there is an edge in the complement of H such that the Ramsey...
AbstractIn this paper we will consider Ramsey-type problems for finite graphs, r-partitions and hype...
We call a graph H Ramsey-unsaturated if there is an edge in the complement of H such that the Ramsey...
AbstractAn induced subgraph is called homogeneous if it is either a clique or an independent set. Le...
An n-vertex graph G is c-Ramsey if it contains neither a complete nor an empty induced subgraph of s...
We consider the variation of Ramsey numbers introduced by Erdős and Pach [J. Graph Theory, 7 (1983)...
AbstractLet F be a graph of order v(F)≥3 and size e(F), and let ρ(F)=(e(F)−1)/(v(F)−2). It is shown ...
We consider a variation of Ramsey numbers introduced by Erdős and Pach [6], where instead of seeking...
We consider the variation of Ramsey numbers introduced by Erdös and Pach [J. Graph Theory, 7 (1983),...
We consider the variation of Ramsey numbers introduced by Erdos and Pach [J. Graph Theory, 7 (1983),...
AbstractThe following theorem is proved: Let G be a finite graph with cl(G) = m, where cl(G) is the ...
A graph with many vertices cannot be homogeneous, i.e., for any pair of integers (i,j) all large gra...
AbstractIn this paper we will consider Ramsey-type problems for finite graphs, r-partitions and hype...
We use techniques of logic, particularly set theory, to determine upper bounds on the big Ramsey deg...
We use techniques of logic, particularly set theory, to determine upper bounds on the big Ramsey deg...
We call a graph H Ramsey-unsaturated if there is an edge in the complement of H such that the Ramsey...
AbstractIn this paper we will consider Ramsey-type problems for finite graphs, r-partitions and hype...
We call a graph H Ramsey-unsaturated if there is an edge in the complement of H such that the Ramsey...
DOI
Add to ORKG