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

DOI10.1016/J.DISC.2023.113785zbMATH Open1530.05124MaRDI QIDQ6136669FDOQ6136669

Authors:

Publication date: 17 January 2024

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

Recommendations

• On characterizing the critical graphs for matching Ramsey numbers
• Generalizations of some Ramsey-type theorems for matchings
• Stars versus stripes Ramsey numbers
• Coverings by few monochromatic pieces: a transition between two Ramsey problems
• scientific article; zbMATH DE number 2148774

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

• An Ore-type theorem on equitable coloring
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Ore-type versions of Brooks' theorem
• 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
• Graph theory with applications
• Note on Hamilton Circuits
• Degree conditions for k‐ordered hamiltonian graphs
• Title not available (Why is that?)
• Small Ramsey numbers
• Improved bounds for Erdős' matching conjecture
• Title not available (Why is that?)
• The Ramsey number for stripes
• On characterizing the critical graphs for matching Ramsey numbers
• Stars versus stripes Ramsey numbers

Cited In (1)

• Ascending Ramsey sequences in graphs

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

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