On the multi-colored Ramsey numbers of paths and even cycles

zbMath1351.05151MaRDI QIDQ727052

Gábor N. Sárközy

Publication date: 6 December 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i3p53

zbMATH Keywords

pathscyclesRamsey numbers

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (9)

Monochromatic connected matchings in 2‐edge‐colored multipartite graphs ⋮ On some Multicolor Ramsey Properties of Random Graphs ⋮ On Multicolor Ramsey Numbers of Triple System Paths of Length 3 ⋮ Turán‐type problems for long cycles in random and pseudo‐random graphs ⋮ Random bipartite Ramsey numbers of long cycles ⋮ Three-color Ramsey number of an odd cycle versus bipartite graphs with small bandwidth ⋮ Improved bounds on the multicolor Ramsey numbers of paths and even cycles ⋮ Bipartite Ramsey numbers of cycles for random graphs ⋮ Multicolour Ramsey numbers of paths and even cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Ramsey number for a triple of long even cycles
• Connected graphs without long paths
• The 3-colored Ramsey number of even cycles
• \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
• Small Ramsey numbers
• Path Ramsey numbers in multicolorings
• Three-color Ramsey numbers for paths
• New lower bounds on the multicolor Ramsey numbers \(R_{r}(C_{2m})\)
• On the multi-colored Ramsey numbers of cycles
• On maximal paths and circuits of graphs
• The History of Degenerate (Bipartite) Extremal Graph Problems

This page was built for publication: On the multi-colored Ramsey numbers of paths and even cycles