Ramsey number of paths and connected matchings in Ore-type host graphs
From MaRDI portal
Publication:267181
DOI10.1016/J.DISC.2016.01.014zbMATH Open1333.05193OpenAlexW2287985623MaRDI QIDQ267181FDOQ267181
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
Recommendations
Cites Work
- An Ore-type theorem on equitable coloring
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- 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
- Title not available (Why is that?)
- Note on Hamilton Circuits
- Tripartite Ramsey numbers for paths
- Some Ramsey-Turán type problems and related questions
- Degree conditions for k‐ordered hamiltonian graphs
- Partitioning 2-edge-colored graphs by monochromatic paths and cycles
- Title not available (Why is that?)
- 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
Cited In (3)
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)
