Sparse Ramsey graphs

DOI10.1007/BF02579159MaRDI QIDQ795843zbMATH OpenOpenAlexFDO

Authors Vojtěch Rödl, J. 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

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

Recommendations

• Ramsey numbers for sparse graphs
• Sparse anti-Ramsey graphs
• On Ramsey Numbers of Sparse Graphs
• Ramsey numbers of sparse hypergraphs
• Ramsey numbers of sparse hypergraphs
• Linear Ramsey numbers of sparse graphs
• On globally sparse Ramsey graphs
• Multipartite graph-sparse graph Ramsey numbers
• Globally sparse vertex‐ramsey graphs
• scientific article; zbMATH DE number 3869371

Cites work

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

Cited in

(10)

• Two Ramsey problems in blowups of graphs
• The partite construction and Ramsey set systems
• Ramsey-type numbers involving graphs and hypergraphs with large girth
• Ramsey-type numbers involving graphs and hypergraphs with large girth
• On Ramsey families of sets
• scientific article; zbMATH DE number 3869371 (Why is no real title available?)
• On Ramsey Numbers of Sparse Graphs
• A Sparse Graham-Rothschild Theorem
• Globally sparse vertex‐ramsey graphs
• Independence for partition regular equations

This page was built for publication: Sparse Ramsey graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q795843)