Indexed metadata
Cubic Graphs with Small Independence Ratio
József Balogh, Alexandr Kostochka, Xujun Liu
Source 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óka improved it to in 2016. Bollobás 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
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.