On Validity of Reed Conjecture for {P_5, Flag^C}-free graphs
Combinatorics
2017-06-27 v1
Abstract
Here we prove that Reed Conjecture is valid for {P5, Flag_Complement}-free graphs where FlagComplement is the complement of the Flag graph. Some of the known results follow as corollaries to our result. Reed conjecture is still open in general.
Cite
@article{arxiv.1706.07906,
title = {On Validity of Reed Conjecture for {P_5, Flag^C}-free graphs},
author = {Medha Dhurandhar},
journal= {arXiv preprint arXiv:1706.07906},
year = {2017}
}
Comments
4 pages, 1 figure