Degree conditions for Ramsey goodness of paths

DOI10.1016/j.ejc.2024.104082MaRDI QIDQ6655704

Unnamed Author, Walner Mendonça, Unnamed Author

Publication date: 27 December 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

Ramsey number\(r\)-good graphs

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ramsey goodness of paths
• Some Ramsey-Turán type problems and related questions
• A new class of Ramsey-Turán problems
• Ryser's conjecture for tripartite 3-graphs
• The clique complex and hypergraph matching
• Ramsey goodness and beyond
• The longest cycles in a graph G with minimum degree at least \(| G| /k\)
• All Ramsey numbers for cycles in graphs
• A condition for matchability in hypergraphs
• On Schelp's problem for three odd long cycles
• Ramsey-goodness -- and otherwise
• Cycles and stability
• A Note on Vertex List Colouring
• Monochromatic Cycles in 2-Coloured Graphs
• Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp
• On Forming Committees
• Generalizations of a Ramsey-theoretic result of chvátal
• The longest cycle of a graph with a large minimal degree
• Ramsey Goodness of Bounded Degree Trees
• Ramsey Goodness of Cycles
• Ramsey Goodness of Clique Versus Paths in Random Graphs
• The Ramsey number of the clique and the hypercube
• Some remarks on the theory of graphs
• Ramsey numbers of cycles versus general graphs
• Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree
• Long monochromatic even cycles in 3‐edge‐coloured graphs of large minimum degree
• Ramsey goodness of trees in random graphs

This page was built for publication: Degree conditions for Ramsey goodness of paths