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

DOI10.1016/J.DISC.2016.01.014MaRDI QIDQ267181zbMATH OpenOpenAlexFDO

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

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

pathsconnected matchingsOre-type graphsRamsey numbers

Mathematics Subject Classification ID

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

Recommendations

• Star versus two stripes Ramsey numbers and a conjecture of Schelp
• scientific article; zbMATH DE number 7104553
• Ramsey numbers of connected clique matchings
• An improvement on Łuczak's connected matchings method
• Monochromatic connected matchings in 2‐edge‐colored multipartite graphs

Cites work

• scientific article; zbMATH DE number 3141016 (Why is no real title available?)
• scientific article; zbMATH DE number 878896 (Why is no real title available?)
• scientific article; zbMATH DE number 3215864 (Why is no real title available?)
• scientific article; zbMATH DE number 3262254 (Why is no real title available?)
• A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem
• An Ore-type theorem on equitable coloring
• An improved bound for the monochromatic cycle partition number
• Degree conditions for k‐ordered hamiltonian graphs
• Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
• Monochromatic cycles in 2-coloured graphs
• New Ore-type conditions for \(H\)-linked graphs
• Note on Hamilton Circuits
• Ore-type versions of Brooks' theorem
• Partitioning 2-edge-colored Ore-type graphs by monochromatic cycles
• Partitioning 2-edge-colored graphs by monochromatic paths and cycles
• Some Ramsey-Turán type problems and related questions
• Star versus two stripes Ramsey numbers and a conjecture of Schelp
• The 3-colored Ramsey number of even cycles
• The Ramsey number for a triple of long even cycles
• Three-color Ramsey numbers for paths
• Tripartite Ramsey numbers for paths
• \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)

Cited in

(3)

• Star versus two stripes Ramsey numbers and a conjecture of Schelp
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles

This page was built for publication: Ramsey number of paths and connected matchings in Ore-type host graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q267181)