Fractional Chromatic Number, Maximum Degree, and Girth

DOI10.1137/20M1382283zbMath1479.05119arXiv1904.05618OpenAlexW3215181870MaRDI QIDQ5013575

Jean-Sébastien Sereni, François Pirot

Publication date: 1 December 2021

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey theorygirthtriangle-freefractional coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Ramsey theory (05D10) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Independence in graphs with maximum degree four
• The strong perfect graph theorem
• A note on the independence number of triangle-free graphs
• A note on the independence number of triangle-free graphs. II
• Constructions for cubic graphs with large girth
• The list chromatic number of graphs with small clique number
• Local algorithms, regular graphs of large girth, and random regular graphs
• 11/30 (Finding large independent sets in connected triangle-free 3- regular graphs)
• Dynamic cage survey
• Fractional colorings of cubic graphs with large girth
• Some Ramsey-Type Numbers and the Independence Ratio
• The Independence Ratio of Regular Graphs
• Large independent sets in triangle-free cubic graphs: beyond planarity
• Coloring triangle‐free graphs with local list sizes
• Subcubic triangle-free graphs have fractional chromatic number at most 14/5
• Some remarks on the theory of graphs
• Graph colouring and the probabilistic method

This page was built for publication: Fractional Chromatic Number, Maximum Degree, and Girth