English

Cubic graphs with small independence ratio

Combinatorics 2019-02-12 v2

Abstract

Let i(r,g)i(r,g) denote the infimum of the ratio α(G)V(G)\frac{\alpha(G)}{|V(G)|} over the rr-regular graphs of girth at least gg, where α(G)\alpha(G) is the independence number of GG, and let i(r,):=limgi(r,g)i(r,\infty) := \lim\limits_{g \to \infty} i(r,g). Recently, several new lower bounds of i(3,)i(3,\infty) were obtained. In particular, Hoppen and Wormald showed in 2015 that i(3,)0.4375i(3, \infty) \ge 0.4375, and Cs\'oka improved it to i(3,)0.44533i(3,\infty) \ge 0.44533 in 2016. Bollob\'as proved the upper bound i(3,)<613i(3,\infty) < \frac{6}{13} in 1981, and McKay improved it to i(3,)<0.45537i(3,\infty) < 0.45537 in 1987. There were no improvements since then. In this paper, we improve the upper bound to i(3,)0.454.i(3,\infty) \le 0.454.

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

R2 v1 2026-06-22T21:13:42.171Z