Recent developments in graph Ramsey theory
Authors:
- David ConlonDCDavid Conlon
- Jacob FoxJFJacob Fox
- Benny SudakovBSBenny Sudakov
- 2 July 2015
- book chapter
- Published by Cambridge University Press (CUP)
- p. 49-118
Abstract
Surveys in Combinatorics 2015 - July 2015Keywords
All Related Versions
This publication has 162 references indexed in Scilit:
- On Generalized Ramsey Numbers for 3‐Uniform HypergraphsJournal of Graph Theory, 2013
- The fractional version of Hedetniemi’s conjecture is trueEuropean Journal of Combinatorics, 2011
- The size‐Ramsey number of treesRandom Structures & Algorithms, 2011
- Sparse partition universal graphs for graphs of bounded degreeAdvances in Mathematics, 2011
- A conjecture of Erdős on graph Ramsey numbersAdvances in Mathematics, 2011
- Embeddings and Ramsey numbers of sparse κ-uniform hypergraphsCombinatorica, 2009
- Induced Ramsey-type theoremsAdvances in Mathematics, 2008
- A variant of the classical Ramsey problemCombinatorica, 1997
- Cycles in graphs and functional inequalitiesMathematical Notes, 1989
- Homomorphies tze f r GraphenMathematische Annalen, 1968