On Validity of Reed Conjecture for Classes of Graphs with Two Forbidden Subgraphs
Combinatorics
2019-09-16 v1
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.
Cite
@article{arxiv.1909.02247,
title = {On Validity of Reed Conjecture for Classes of Graphs with Two Forbidden Subgraphs},
author = {Medha Dhurandhar},
journal= {arXiv preprint arXiv:1909.02247},
year = {2019}
}
Comments
7 pages. arXiv admin note: text overlap with arXiv:1611.02063 by other authors