Indexed metadata

Cubic Graphs with Small Independence Ratio

József Balogh, Alexandr Kostochka, Xujun Liu

Source record

Source: Crossref

Published: Mar 22, 2019

DOI: 10.37236/7272

Open original source ↗

Source 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,∞):=lim⁡g→∞i(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.4375,i(3, \infty) \geqslant 0.4375, and Csóka improved it to i(3,∞)⩾0.44533i(3,\infty) \geqslant 0.44533 in 2016. Bollobás 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.45537in 1987. There were no improvements since then. In this paper, we improve the upper bound to i(3,∞)⩽0.454.i(3,\infty) \leqslant 0.454.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.