The Ramsey number for a triple of long even cycles

DOI10.1016/J.JCTB.2006.09.001zbMath1120.05060OpenAlexW2031273169MaRDI QIDQ885294

Agnieszka Figaj, Tomasz Łuczak

Publication date: 8 June 2007

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2006.09.001

zbMATH Keywords

cyclesRamsey numbersRegularity lemma

Mathematics Subject Classification ID

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

Related Items (44)

Ramsey number of paths and connected matchings in Ore-type host graphs ⋮ Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp ⋮ Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree ⋮ Gallai-Ramsey numbers for rainbow \(P_5\) and monochromatic fans or wheels ⋮ Stability for vertex cycle covers ⋮ On Schelp's problem for three odd long cycles ⋮ Long monochromatic Berge cycles in colored 4-uniform hypergraphs ⋮ Ramsey numbers of 3-uniform loose paths and loose cycles ⋮ Diagonal Ramsey Numbers of Loose Cycles in Uniform Hypergraphs ⋮ Long monochromatic even cycles in 3‐edge‐coloured graphs of large minimum degree ⋮ Color‐biased Hamilton cycles in random graphs ⋮ Monochromatic connected matchings in 2‐edge‐colored multipartite graphs ⋮ On three-color Ramsey number of paths ⋮ Ramsey numbers of large even cycles and fans ⋮ An improvement on Łuczak's connected matchings method ⋮ On some Multicolor Ramsey Properties of Random Graphs ⋮ Turán‐type problems for long cycles in random and pseudo‐random graphs ⋮ On the restricted size Ramsey number for a pair of cycles ⋮ Bipartite Ramsey numbers of cycles ⋮ Random bipartite Ramsey numbers of long cycles ⋮ Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth ⋮ Three-color Ramsey number of an odd cycle versus bipartite graphs with small bandwidth ⋮ Monochromatic Hamiltoniant-tight Berge-cycles in hypergraphs ⋮ Exact Ramsey numbers of odd cycles via nonlinear optimisation ⋮ Monochromatic matchings in the shadow graph of almost complete hypergraphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Coverings by few monochromatic pieces: a transition between two Ramsey problems ⋮ Improved bounds on the multicolor Ramsey numbers of paths and even cycles ⋮ The Ramsey Number for 3-Uniform Tight Hypergraph Cycles ⋮ A multipartite Ramsey number for odd cycles ⋮ Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs ⋮ The Ramsey numbers for a triple of long cycles ⋮ On the multi-colored Ramsey numbers of paths and even cycles ⋮ The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle ⋮ Long monochromatic paths and cycles in 2-edge-colored multipartite graphs ⋮ Bipartite Ramsey numbers of cycles for random graphs ⋮ Multipartite Ramsey numbers for odd cycles ⋮ Matchings with few colors in colored complete graphs and hypergraphs ⋮ Ramsey Number of a Connected Triangle Matching ⋮ The 3-colored Ramsey number of even cycles ⋮ Gallai-Ramsey number of even cycles with chords ⋮ Ramsey numbers for bipartite graphs with small bandwidth ⋮ The Ramsey number for hypergraph cycles. I. ⋮ Multicolour Ramsey numbers of paths and even cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the combinatorial problems which I would most like to see solved
• All Ramsey numbers for cycles in graphs
• Generalized Ramsey theory for multiple colors
• \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
• Path Ramsey numbers in multicolorings
• Ramsey numbers for cycles in graphs
• On a Ramsey-type problem of J. A. Bondy and P. Erdős. II
• Generalized and geometric Ramsey numbers for cycles.

This page was built for publication: The Ramsey number for a triple of long even cycles