We investigate the minimization problem of the minimum degree of minimal Ramsey graphs, initiated by Burr, Erdős, and Lovász. We determine the corresponding graph parameter for numerous bipartite graphs, including bi-regular bipartite graphs and forests. We also make initial progress for graphs of larger chromatic number. Numerous interesting problems remain open
We study two classical problems in graph Ramsey theory, that of determining the Ramsey number of bo...
AbstractThe Ramsey number of a graph G is the least number t for which it is true that whenever the ...
AbstractWe estimate the minimum possible Ramsey numbers for graphs of given order
We investigate the minimization problem of the minimum degree of minimal Ramsey graphs, initiated by...
We investigate the minimization problem of the minimum degree of minimal Ramsey graphs, initiated by...
For graphs $F$ and $H$, we say $F$ is Ramsey for $H$ if every $2$-coloring of the edges of $F$ conta...
Abstract. For graphs F and H, we say F is Ramsey for H if every 2-coloring of the edges of F contain...
We prove that $s_r(K_k) = O(k^5 r^{5/2})$, where $s_r(K_k)$ is the Ramsey parameter introduced by Bu...
We prove that (Formula presented.), where (Formula presented.) is the Ramsey parameter introduced by...
We prove that (Formula presented.), where (Formula presented.) is the Ramsey parameter introduced by...
AbstractFor any graphs G and H, we write F → (G, H) to means that in any red-blue coloring of all th...
For a graph H and an integer n, theTurán number ex(n, H) isthemaximum possible number of edges in a ...
AbstractIn this paper the following Ramsey–Turán type problem is one of several addressed. For which...
AbstractFor graphs G,F and H we write G→(F,H) to mean that if the edges of G are coloured with two c...
AbstractFor any graphs G and H, we write F → (G, H) to means that in any red-blue coloring of all th...
We study two classical problems in graph Ramsey theory, that of determining the Ramsey number of bo...
AbstractThe Ramsey number of a graph G is the least number t for which it is true that whenever the ...
AbstractWe estimate the minimum possible Ramsey numbers for graphs of given order
We investigate the minimization problem of the minimum degree of minimal Ramsey graphs, initiated by...
We investigate the minimization problem of the minimum degree of minimal Ramsey graphs, initiated by...
For graphs $F$ and $H$, we say $F$ is Ramsey for $H$ if every $2$-coloring of the edges of $F$ conta...
Abstract. For graphs F and H, we say F is Ramsey for H if every 2-coloring of the edges of F contain...
We prove that $s_r(K_k) = O(k^5 r^{5/2})$, where $s_r(K_k)$ is the Ramsey parameter introduced by Bu...
We prove that (Formula presented.), where (Formula presented.) is the Ramsey parameter introduced by...
We prove that (Formula presented.), where (Formula presented.) is the Ramsey parameter introduced by...
AbstractFor any graphs G and H, we write F → (G, H) to means that in any red-blue coloring of all th...
For a graph H and an integer n, theTurán number ex(n, H) isthemaximum possible number of edges in a ...
AbstractIn this paper the following Ramsey–Turán type problem is one of several addressed. For which...
AbstractFor graphs G,F and H we write G→(F,H) to mean that if the edges of G are coloured with two c...
AbstractFor any graphs G and H, we write F → (G, H) to means that in any red-blue coloring of all th...
We study two classical problems in graph Ramsey theory, that of determining the Ramsey number of bo...
AbstractThe Ramsey number of a graph G is the least number t for which it is true that whenever the ...
AbstractWe estimate the minimum possible Ramsey numbers for graphs of given order
DOI
Add to ORKG