On Validity of Reed Conjecture for Classes of Graphs with Two Forbidden Subgraphs
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.