Abstract: In a seminal paper from 1983, Burr and Erdos started the systematic study of Ramsey numbers of cliques vs. large sparse graphs, raising a number of problems. In this paper we develop a new approach to such Ramsey problems using a mix of the Szemeredi regularity lemma, embedding of sparse graphs, Turan type stability, and other structural results. We give exact Ramsey numbers for various classes of graphs, solving all but one of the Burr-Erdos problems.
Recommendations
Cited in
(38)- Ramsey goodness of bounded degree trees
- The Ramsey numbers of squares of paths and cycles
- Lower bounds for r₂(K₁ + G) and r₃(K₁ + G) from Paley graph and generalization
- Ramsey numbers for multiple copies of sparse graphs
- Dependent random choice
- The Ramsey number of Fano plane versus tight path
- Ramsey good graphs with long suspended paths
- RAMSEY’S COHEIRS
- Ramsey numbers of a fixed odd-cycle and generalized books and fans
- scientific article; zbMATH DE number 7172369 (Why is no real title available?)
- Ramsey Numbers Involving Large Books
- Large joints in graphs
- Ramsey number of \(K_3\) versus \(F_{3, n}\)
- Ramsey goodness and generalized stars
- scientific article; zbMATH DE number 7533315 (Why is no real title available?)
- Calculating Ramsey numbers by partitioning colored graphs
- On a conjecture of Conlon, Fox, and Wigderson
- Blowup Ramsey numbers
- Ramsey goodness of paths
- Ramsey numbers of cubes versus cliques
- Goodman’s Only World
- Ramsey numbers of fans and large books
- The Ramsey number of the clique and the hypercube
- Ramsey numbers of large books versus multipartite graphs
- Degree conditions for Ramsey goodness of paths
- Star-critical Ramsey numbers involving large books
- Ramsey numbers involving a long path
- On Ramsey and star-critical Ramsey numbers for generalized fans versus \(n K_m\)
- Ramsey non-goodness involving books
- Ramsey goodness of cycles
- Off-diagonal book Ramsey numbers
- On graphs for which large books are Ramsey good
- Three-color Ramsey number of an odd cycle versus bipartite graphs with small bandwidth
- A note on Ramsey numbers involving large books
- On the Ramsey number of the triangle and the cube
- Ramsey-goodness -- and otherwise
- Semidefinite programming and Ramsey numbers
- Ramsey goodness of clique versus paths in random graphs
This page was built for publication: Ramsey goodness and beyond
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987556)
