On globally sparse Ramsey graphs

DOI10.1016/j.disc.2013.07.023zbMath1281.05088arXiv1108.1102MaRDI QIDQ393934

Torsten Mütze, Ueli Peter

Publication date: 24 January 2014

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

Full work available at URL: https://arxiv.org/abs/1108.1102

zbMATH Keywords

Ramsey theory; arboricity; graph density; Nash-Williams theorem

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

05C55: Generalized Ramsey theory

05C42: Density (toughness, etc.)

Related Items

The Size Ramsey Number of Graphs with Bounded Treewidth, Minimal ordered Ramsey graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Density theorems for bipartite graphs and related Ramsey-type results
• Star arboricity
• On multicolor Ramsey numbers for complete bipartite graphs
• The Ramsey property for graphs with forbidden complete subgraphs
• The star arboricity of graphs
• New lower bounds on the multicolor Ramsey numbers \(R_{r}(C_{2m})\)
• Ramsey numbers for cycles in graphs
• On the minimum degree of minimal Ramsey graphs
• On the multi-colored Ramsey numbers of cycles
• The minimum degree of Ramsey-minimal graphs
• On the Folkman Numberf(2, 3, 4)
• Globally sparse vertex‐ramsey graphs
• The Induced Size-Ramsey Number of Cycles
• Two variants of the size Ramsey number
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
• Generalized Ramsey Theory for Graphs. II. Small Diagonal Numbers
• Decomposition of Finite Graphs Into Forests