On Ramsey graphs without bipartite subgraphs

DOI10.1016/0012-365X(92)90605-FzbMath0766.05057OpenAlexW2080652794MaRDI QIDQ1197030

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

Publication date: 16 January 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(92)90605-f

zbMATH Keywords

bipartite graphstriangle-free graphRamsey graphs

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Related Items (2)

Distance Preserving Ramsey Graphs ⋮ Random Ramsey graphs for the four-cycle

Cites Work

• Simple proof of the existence of restricted Ramsey graphs by means of a partite construction
• The Ramsey property for graphs with forbidden complete subgraphs
• Strong Ramsey Theorems for Steiner Systems
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
• Unnamed Item
• Unnamed Item

This page was built for publication: On Ramsey graphs without bipartite subgraphs