New lower bounds on the multicolor Ramsey numbers \(R_{r}(C_{2m})\)

DOI10.1007/s00373-006-0659-yzbMath1099.05062OpenAlexW2062632885MaRDI QIDQ2502037

Yongqi Sun, Yuansheng Yang, Li Bingxi, Feng Xu

Publication date: 12 September 2006

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-006-0659-y

zbMATH Keywords

cycleedge coloringforbidden subgraph

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Related Items (12)

Exact values of multicolor Ramsey numbers \(R_l(C_{\le l+1})\) ⋮ On globally sparse Ramsey graphs ⋮ The (t−1) $(t-1)$‐chromatic Ramsey number for paths ⋮ An improvement on Łuczak's connected matchings method ⋮ Random bipartite Ramsey numbers of long cycles ⋮ Upper density of monochromatic paths in edge-coloured infinite complete graphs and bipartite graphs ⋮ Improved bounds on the multicolor Ramsey numbers of paths and even cycles ⋮ On the multi-colored Ramsey numbers of paths and even cycles ⋮ New lower bounds on the size-Ramsey number of a path ⋮ Multicolour bipartite Ramsey number of paths ⋮ On the multi-colored Ramsey numbers of cycles ⋮ Multicolour Ramsey numbers of paths and even cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• All Ramsey numbers for cycles in graphs
• On multicolor Ramsey numbers for complete bipartite graphs
• Generalised Ramsey numbers for small graphs
• New lower bounds on the multicolor Ramsey numbers \(r_k(C_4)\)
• Ramsey numbers for cycles in graphs
• On the Ramsey numbers N(3,3,\dots ,3;2)
• Graphs without four-cycles
• The Ramsey number r(C₇,C₇,C₇)
• Combinatorial Relations and Chromatic Graphs

This page was built for publication: New lower bounds on the multicolor Ramsey numbers \(R_{r}(C_{2m})\)