Hahn–Hell–Poljak conjecture for odd wheels
Hahn–Hell–Poljak conjecture for odd wheels
Let be the join of the cycle with , and let denote the ultimate independence ratio of a graph . For odd wheels, is bounded below by because and . Hahn–Hell–Poljak's conjecture. For all integers ,
Determining the ultimate independence ratio of odd wheels is a central open problem in this setting; the -wheel is identified as the smallest graph whose ratio is unknown.
Sources & referencesView supporting material
Primary source
Alexander Clow, Hitesh Kumar and Shivaramakrishna Pragada, “Improved Bounds for the Ultimate Independence Ratio of Odd Wheels”, arXiv:2511.18747 (2025).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.