On Validity of Reed Conjecture for Classes of Graphs with Two Forbidden Subgraphs

2019/09/05 by Dhurandhar, Medha
#05C15 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1909.02247

Abstract

Reed Conjecture is open for more than 20 years now. Here we prove that Reed Conjecture is valid for (1) P4UnionK1, Kite-free graphs (2) Chair, Kite-free graphs (3) K2UnionK2complement , H-free graphs and (4) 2K2, M-free graphs where H and M are graphs on six vertices each. Reed conjecture is still open in general.

Related

• On Validity of Reed Conjecture for P₅, Flag^C-free graphs
• Reed's conjecture on some special classes of graphs
• Sufficient condition for Reed's conjecture
• A note on Reed's Conjecture about \ω, \Δ and \χ with\n respect to vertices of high degree
• A note on Reed's conjecture