What is Ramsey-equivalent to a clique?
Authors:
- Jacob FoxJFJacob Fox
- Andrey GrinshpunAGAndrey Grinshpun
- Anita LiebenauALAnita Liebenau
- Yury PersonYPYury Person
- Tibor SzabóTSTibor Szabó
- 1 November 2014
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 109, 120-133
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Packard Fellowship
- Simons Fellowship
- NSF
- Sloan Foundation Fellowship
- MIT NEC Corporation
- National Physical Science Consortium fellowship
- Berlin Mathematical School
- DFG (DMS-1069197, SZ 261/1-1)
This publication has 7 references indexed in Scilit:
- A new upper bound for diagonal Ramsey numbersAnnals of Mathematics, 2009
- On the minimum degree of minimal Ramsey graphsJournal of Graph Theory, 2009
- The minimum degree of Ramsey‐minimal graphsJournal of Graph Theory, 2006
- The Ramsey property for graphs with forbidden complete subgraphsJournal of Combinatorial Theory, Series B, 1976
- On chromatic number of graphs and set-systemsActa Mathematica Hungarica, 1966
- Some remarks on the theory of graphsBulletin of the American Mathematical Society, 1947
- On a Problem of Formal LogicProceedings of the London Mathematical Society, 1930