Ramsey goodness and beyond
From MaRDI portal
Publication:987556
DOI10.1007/S00493-009-2409-2zbMATH Open1212.05173arXivmath/0703653OpenAlexW1606812353WikidataQ105941708 ScholiaQ105941708MaRDI QIDQ987556FDOQ987556
Authors: Vladimir Nikiforov, Cecil Rousseau 
Publication date: 13 August 2010
Published in: Combinatorica (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/math/0703653
Recommendations
Cited In (38)
- Lower bounds for \(r_2(K_1 + G)\) and \(r_3(K_1 + 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
- Title not available (Why is that?)
- Ramsey Numbers Involving Large Books
- Large joints in graphs
- Ramsey number of \(K_3\) versus \(F_{3, n}\)
- Ramsey goodness and generalized stars
- Title not available (Why is that?)
- Calculating Ramsey numbers by partitioning colored graphs
- On a conjecture of Conlon, Fox, and Wigderson
- Blowup Ramsey numbers
- Ramsey goodness of paths
- Goodman’s Only World
- The Ramsey number of the clique and the hypercube
- Ramsey numbers of large books versus multipartite graphs
- Ramsey numbers of fans and large books
- Ramsey numbers of cubes versus cliques
- 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
- On graphs for which large books are Ramsey good
- Off-diagonal book Ramsey numbers
- A note on Ramsey numbers involving large books
- Three-color Ramsey number of an odd cycle versus bipartite graphs with small bandwidth
- On the Ramsey number of the triangle and the cube
- Semidefinite programming and Ramsey numbers
- Ramsey goodness of clique versus paths in random graphs
- Ramsey-goodness -- and otherwise
- Ramsey goodness of bounded degree trees
- The Ramsey numbers of squares of paths and cycles
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)
