Simple proof of the existence of restricted Ramsey graphs by means of a partite construction

DOI10.1007/BF02579274zbMath0491.05044OpenAlexW2047580516MaRDI QIDQ1167185

Vojtěch Rödl, Jaroslav Nešetřil

Publication date: 1981

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579274

zbMATH Keywords

clique numberinduced monochromatic subgraph

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Generalized Ramsey theory (05C55)

Related Items (13)

Ramsey-type numbers involving graphs and hypergraphs with large girth ⋮ The partite construction and Ramsey set systems ⋮ Guarding galleries where every point sees a large area ⋮ The property of \(k\)-colourable graphs is uniquely decomposable ⋮ A Ramsey class for Steiner systems ⋮ On some generalized vertex Folkman numbers ⋮ Tension continuous maps -- their structure and applications ⋮ Ramsey-type numbers involving graphs and hypergraphs with large girth ⋮ On Ramsey graphs without bipartite subgraphs ⋮ On the nonexistence of some generalized Folkman numbers ⋮ Iterated combinatorial density theorems ⋮ Two proofs of the Ramsey property of the class of finite hypergraphs ⋮ All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)

Cites Work

• The Ramsey property for graphs with forbidden complete subgraphs
• A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph
• A short proof of the existence of highly chromatic hypergraphs without short cycles
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring

This page was built for publication: Simple proof of the existence of restricted Ramsey graphs by means of a partite construction