Ramsey-Turán type results for matchings in edge colored graphs

DOI10.1016/j.disc.2023.113785zbMath1530.05124MaRDI QIDQ6136669

No author found.

Publication date: 17 January 2024

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

zbMATH Keywords

matchingRamsey numberOre-type conditionRamsey closure

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved bounds for Erdős' matching conjecture
• Ore-type versions of Brooks' theorem
• Small Ramsey numbers
• On characterizing the critical graphs for matching Ramsey numbers
• Stars versus stripes Ramsey numbers
• An Ore-type theorem on equitable coloring
• Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles
• Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp
• New Ore-Type Conditions for H-Linked Graphs
• Note on Hamilton Circuits
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• The Ramsey number for stripes
• Degree conditions for k‐ordered hamiltonian graphs

This page was built for publication: Ramsey-Turán type results for matchings in edge colored graphs