A Note on Induced Ramsey Numbers

DOI10.1007/978-3-319-44479-6_13zbMath1387.05162arXiv1601.01493OpenAlexW2231445814MaRDI QIDQ4604379

David Conlon, Domingos jun. Dellamonica, Vojtěch Rödl, Mathias Schacht, Steven La Fleur

Publication date: 26 February 2018

Published in: A Journey Through Discrete Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Hypergraphs (05C65) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (2)

Largest subgraph from a hereditary property in a random graph ⋮ An efficient container lemma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On two problems in graph Ramsey theory
• An improved bound for the stepping-up lemma
• Hypergraph containers
• An exponential-type upper bound for Folkman numbers
• Density theorems for bipartite graphs and related Ramsey-type results
• Partitions of finite relational and set systems
• Induced Ramsey numbers
• Recent developments in graph Ramsey theory
• Models Without Indiscernibles
• Independent sets in hypergraphs
• A Short Proof of the Random Ramsey Theorem
• Combinatorial Theorems on Classifications of Subsets of a Given Set
• Induced Ramsey-type theorems

This page was built for publication: A Note on Induced Ramsey Numbers