Cubic graphs with small independence ratio

Abstract

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

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…