The interlace-polynomial gap conjecture
Let denote the interlace polynomial of a graph . There are constants with
such that, for every and all sufficiently large , there are graphs of order satisfying
for , and every graph of order with satisfies for some . Gap conjecture. The values of above each fixed threshold eventually consist precisely of a discrete sequence of asymptotic levels. This conjecture concerns the unexplained gaps between successive large values of the interlace polynomial.
References
- Richard Arratia, Bela Bollobas and Gregory B. Sorkin, “The Interlace Polynomial of a Graph”, arXiv:math/0209045 (2004).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.