Ramsey number of paths and connected matchings in Ore-type host graphs

DOI10.1016/j.disc.2016.01.014zbMath1333.05193OpenAlexW2287985623MaRDI QIDQ267181

János Barát, Gábor N. Sárközy, Jenő Lehel, András Gyárfás

Publication date: 8 April 2016

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

Full work available at URL: https://doi.org/10.1016/j.disc.2016.01.014

zbMATH Keywords

pathsRamsey numbersconnected matchingsOre-type graphs

Mathematics Subject Classification ID

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

Related Items

Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some Ramsey-Turán type problems and related questions
• Partitioning 2-edge-colored graphs by monochromatic paths and cycles
• A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem
• An improved bound for the monochromatic cycle partition number
• The Ramsey number for a triple of long even cycles
• Ore-type versions of Brooks' theorem
• The 3-colored Ramsey number of even cycles
• \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
• Three-color Ramsey numbers for paths
• An Ore-type theorem on equitable coloring
• Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
• Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles
• Monochromatic Cycles in 2-Coloured Graphs
• Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp
• New Ore-Type Conditions for H-Linked Graphs
• Note on Hamilton Circuits
• Tripartite Ramsey numbers for paths
• Degree conditions for k‐ordered hamiltonian graphs