Tight Chromatic Upper Bound for {3K1, C5}-free Graphs
Combinatorics
2013-10-02 v2
Abstract
Problem of finding an optimal upper bound for a chromatic no. of 3K1-free graphs is still open and pretty hard. Here we find a tight chromatic upper bound for {3K1, C5}-free graphs. We prove that if G is {3K1, C5}-free, then the chromatic no. <= (3{\omega}-1)/2 where {\omega} is the size of a maximum clique in G and show with examples that the bound is tight.
Keywords
Cite
@article{arxiv.1307.0307,
title = {Tight Chromatic Upper Bound for {3K1, C5}-free Graphs},
author = {Medha Dhurandhar},
journal= {arXiv preprint arXiv:1307.0307},
year = {2013}
}
Comments
This paper has been withdrawn by the author as there is an exception to the theory