The fractional chromatic number of triangle-free subcubic graphs

DOI10.1016/J.EJC.2013.06.006MaRDI QIDQ2509748zbMATH OpenOpenAlexWikidataFDO

Authors David G. Ferguson, Tomáš Kaiser, Daniel Král'

Publication date 29 July 2014

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1203.1308

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Fractional graph theory, fuzzy graph theory (05C72)

Abstract: Heckman and Thomas conjectured that the fractional chromatic number of any triangle-free subcubic graph is at most 14/5. Improving on estimates of Hatami and Zhu and of Lu and Peng, we prove that the fractional chromatic number of any triangle-free subcubic graph is at most 32/11 (which is roughly 2.909).

Recommendations

• Subcubic triangle-free graphs have fractional chromatic number at most \(14/5\)
• Subcubic triangle-free graphs have fractional chromatic number at most \(14/5\)
• An Upper Bound on the Fractional Chromatic Number of Triangle-Free Subcubic Graphs
• The fractional chromatic number of triangle-free graphs with \(\varDelta \leq 3\)
• On the chromatic number of triangle-free graphs of large minimum degree

Cites work

• A new proof of the independence ratio of triangle-free cubic graphs
• An Upper Bound on the Fractional Chromatic Number of Triangle-Free Subcubic Graphs
• Cycles Intersecting Edge-Cuts of Prescribed Sizes
• scientific article; zbMATH DE number 3675940 (Why is no real title available?)
• scientific article; zbMATH DE number 1131873 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• Size and independence in triangle‐free graphs with maximum degree three
• Some Ramsey-Type Numbers and the Independence Ratio
• Subcubic triangle-free graphs have fractional chromatic number at most \(14/5\)
• The fractional chromatic number of graphs of maximum degree at most three
• The fractional chromatic number of triangle-free graphs with \(\varDelta \leq 3\)

Cited in

(11)

• Fractional chromatic numbers of tensor products of three graphs
• The fractional chromatic number of triangle-free graphs with \(\varDelta \leq 3\)
• The fractional chromatic number of graphs of maximum degree at most three
• Fractional colorings of cubic graphs with large girth
• Fractional chromatic number of a random subgraph
• Spotting trees with few leaves
• Subcubic triangle-free graphs have fractional chromatic number at most \(14/5\)
• Subcubic triangle-free graphs have fractional chromatic number at most \(14/5\)
• The Fractional Chromatic Number of \(\boldsymbol{K_{\Delta }}\)-Free Graphs
• Fractional balanced chromatic number of signed subcubic graphs
• Fractional coloring of triangle-free planar graphs

This page was built for publication: The fractional chromatic number of triangle-free subcubic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2509748)