Sparse Ramsey graphs

DOI10.1007/BF02579159zbMath0543.05048OpenAlexW2051667449MaRDI QIDQ795843

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

Publication date: 1984

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey graphscoloring of edgesinduced copy

Mathematics Subject Classification ID

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

Related Items

Independence for partition regular equations ⋮ Ramsey-type numbers involving graphs and hypergraphs with large girth ⋮ The partite construction and Ramsey set systems ⋮ Ramsey-type numbers involving graphs and hypergraphs with large girth ⋮ On Ramsey families of sets

Cites Work

• The Ramsey property for graphs with forbidden complete subgraphs
• A short proof of the existence of highly chromatic hypergraphs without short cycles
• On chromatic number of graphs and set-systems
• On chromatic number of finite set-systems
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring