Cubic graphs with small independence ratio

zbMath1409.05079arXiv1708.03996MaRDI QIDQ1733918

Xujun Liu, József Balogh, Alexandr V. Kostochka

Publication date: 22 March 2019

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Entropy and expansion

Cites Work

• Unnamed Item
• Unnamed Item
• Properties of regular graphs with large girth via local algorithms
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• A note on the independence number of triangle-free graphs. II
• The asymptotic number of labeled graphs with given degree sequences
• Large independent sets in regular graphs of large girth
• Invariant Gaussian processes and independent sets on regular graphs of large girth
• Fractional colorings of cubic graphs with large girth
• Induced Forests in Regular Graphs with Large Girth
• Girth and Independence Ratio
• The Independence Ratio of Regular Graphs

This page was built for publication: Cubic graphs with small independence ratio