Independence-number rationality conjecture for FI-graphs
Independence-number rationality conjecture for FI-graphs
Let be an -graph, and let denote its independence number. Define the generating function
Independence-number rationality conjecture. The generating function is rational. In particular, the function agrees with a quasi-polynomial for all .
This conjecture asks whether the extremal invariant given by independence numbers exhibits the same eventual regularity as counting invariants of -graphs. The paper provides experimental evidence, including a classification of -graphs with quadratically growing vertex sets, but no resolution is stated.
Sources & referencesView supporting material
Primary source
David Guan and Eric Ramos, “Independence numbers in certain families of highly symmetric graphs”, arXiv:2401.16739 (2024).
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.