Sparse Ramsey graphs

DOI10.1007/BF02579159zbMATH Open0543.05048OpenAlexW2051667449MaRDI QIDQ795843FDOQ795843

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

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

zbMATH Keywords

Ramsey graphscoloring of edgesinduced copy

Mathematics Subject Classification ID

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

Cites Work

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

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
• Title not available (Why is that?)
• 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)