Small 1-defective Ramsey numbers in perfect graphs

DOI10.1016/j.disopt.2019.06.001zbMath1506.05135OpenAlexW2949092593MaRDI QIDQ2010929

Oylum Şeker, Tınaz Ekim, John G. Gimbel

Publication date: 28 November 2019

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

Full work available at URL: https://doi.org/10.1016/j.disopt.2019.06.001

zbMATH Keywords

extremal graphs\(k\)-dense set\(k\)-dependent Ramsey number\(k\)-sparse set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (4)

Defective Ramsey numbers and defective cocolorings in some subclasses of perfect graphs ⋮ Small 1-defective Ramsey numbers in perfect graphs ⋮ The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation ⋮ Exact values of defective Ramsey numbers in graph classes

Cites Work

• Graph classes and Ramsey numbers
• Independence in graphs with maximum degree four
• The strong perfect graph theorem
• Planar Ramsey numbers
• Defective coloring on classes of perfect graphs
• Advances on defective parameters in graphs
• Some defective parameters in graphs
• Small 1-defective Ramsey numbers in perfect graphs
• Normal hypergraphs and the perfect graph conjecture
• Generalized Ramsey theory for graphs. I: Diagonal numbers
• Longest paths and cycles in K1,3-free graphs
• Some Ramsey-Type Numbers and the Independence Ratio
• On 1-dependent ramsey numbers for graphs
• Lower bounds on size and independence inK4-free graphs
• On subgraphs without large components

This page was built for publication: Small 1-defective Ramsey numbers in perfect graphs