Fractional colorings of cubic graphs with large girth - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles SIAM Journal on Discrete Mathematics Year : 2011

Fractional colorings of cubic graphs with large girth

Abstract

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.
Fichier principal
Vignette du fichier
KKV11.pdf (371.5 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00635910 , version 1 (09-11-2011)

Identifiers

  • HAL Id : inria-00635910 , version 1

Cite

František Kardoš, Daniel Kráľ, Jan Volec. Fractional colorings of cubic graphs with large girth. SIAM Journal on Discrete Mathematics, 2011, 25 (3), pp.1454-1476. ⟨inria-00635910⟩
144 View
96 Download

Share

Gmail Facebook X LinkedIn More