Two extensions of Ramsey's theorem

DOI10.1215/00127094-2382566zbMath1280.05083arXiv1112.1548OpenAlexW1986940200MaRDI QIDQ394821

Jacob Fox, David Conlon, Benjamin Sudakov

Publication date: 27 January 2014

Published in: Duke Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.1548

zbMATH Keywords

2-coloringmonochromatic clique

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items

On the Mikusiński-Antosik diagonal theorem and the equivalence of two types of convergence in Köthe spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On two problems in graph Ramsey theory
• A new upper bound for diagonal Ramsey numbers
• The Ramsey number of a graph with bounded maximum degree
• On the combinatorial problems which I would most like to see solved
• A new proof of Szemerédi's theorem for arithmetic progressions of length four
• On a metric generalization of Ramsey's theorem
• A few remarks on Ramsey--Turán-type problems
• On homogeneous sets of positive integers
• On graphs with small Ramsey numbers*
• Dependent random choice
• Hypergraph Ramsey numbers
• Partition relations for cardinal numbers
• Some remarks on the theory of graphs
• Combinatorial Theorems on Classifications of Subsets of a Given Set