Publication details
FRACTIONAL COLORINGS OF CUBIC GRAPHS WITH LARGE GIRTH
| Authors | |
|---|---|
| Year of publication | 2011 |
| Type | Article in Periodical |
| Magazine / Source | SIAM Journal on Discrete Mathematics |
| Citation | |
| Doi | http://dx.doi.org/10.1137/100812082 |
| Keywords | cubic graphs; fractional coloring; large girth; random graphs; independent set |
| Description | We show that every (sub) cubic n-vertex graph with sufficiently large girth has fractional chromatic number at most 2.2978, which implies that it contains an independent set of size at least 0.4352n. Our bound on the independence number is valid for random cubic graphs as well, as it improves existing lower bounds on the maximum cut in cubic graphs with large girth. |