Degree Ramsey numbers for even cycles

DOI10.1016/j.disc.2017.08.016zbMath1372.05137arXiv1610.00372OpenAlexW2963882769MaRDI QIDQ2411600

Michael Tait

Publication date: 24 October 2017

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

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

zbMATH Keywords

Ramsey numbergeneralized polygoneven cycledegree Ramsey number

Mathematics Subject Classification ID

Paths and cycles (05C38) Generalized Ramsey theory (05C55)

Related Items

The minimum degree of minimal Ramsey graphs for cliques, Multicolor list Ramsey numbers grow exponentially, Degree bipartite Ramsey numbers, Multicolor Ramsey numbers for Berge cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Degree Ramsey numbers of closed blowups of trees
• Decomposition of bounded degree graphs into \(C_4\)-free subgraphs
• The fractional version of Hedetniemi's conjecture is true
• Degree Ramsey numbers for cycles and blowups of trees
• Expanding graphs contain all small trees
• The Ramsey property for graphs with forbidden complete subgraphs
• The size Ramsey number
• Norm-graphs: Variations and applications
• New examples of graphs without small cycles and of large size
• Chromatic Ramsey numbers
• Cycles of even length in graphs
• Multi-color Ramsey numbers of even cycles
• Degree Ramsey Numbers of Graphs
• Recent developments in graph Ramsey theory
• A Folkman Linear Family
• A new series of dense graphs of high girth
• A note on the Size-Ramsey number of long subdivisions of graphs
• On size Ramsey number of paths, trees, and circuits. I
• A Bound on the Number of Edges in Graphs Without an Even Cycle
• Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
• The size‐Ramsey number of trees
• On size Ramsey numbers of graphs with bounded degree