Cubic graphs with small independence ratio
Combinatorics
2019-02-12 v2
Abstract
Let denote the infimum of the ratio over the -regular graphs of girth at least , where is the independence number of , and let . Recently, several new lower bounds of were obtained. In particular, Hoppen and Wormald showed in 2015 that , and Cs\'oka improved it to in 2016. Bollob\'as proved the upper bound in 1981, and McKay improved it to in 1987. There were no improvements since then. In this paper, we improve the upper bound to
Keywords
Cite
@article{arxiv.1708.03996,
title = {Cubic graphs with small independence ratio},
author = {József Balogh and Alexandr Kostochka and Xujun Liu},
journal= {arXiv preprint arXiv:1708.03996},
year = {2019}
}
Comments
21 pages, 1 figure, 2 tables