Large almost monochromatic subsets in hypergraphs

DOI10.1007/s11856-011-0016-6zbMath1271.05098arXiv0901.3912OpenAlexW2105619976MaRDI QIDQ532593

Jacob Fox, David Conlon, Benjamin Sudakov

Publication date: 5 May 2011

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items

Two Erdős-Hajnal-type theorems in hypergraphs, Erdős-Hajnal-type theorems in hypergraphs, Complete Partite subgraphs in dense hypergraphs, On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• A new upper bound for diagonal Ramsey numbers
• Ramsey-type theorems
• Problems and results in discrete mathematics
• 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