Alon–Kahn conjecture on independent sets in regular graphs
Let be a simple, finite, undirected graph with vertices that is -regular, and let denote its number of independent sets. The graph is the disjoint union of copies of the complete bipartite graph . Alon–Kahn conjecture. For every such graph ,
References
2 papers in this index state this conjecture (2009–2010). The statement above is taken from the most recent of them; the others are arXiv:0909.3354.
Status
- Solved: Yufei Zhao. The Number of Independent Sets in a Regular Graph (Combinatorics, Probability and Computing, 2010) https://www.cambridge.org/core/journals/combinatorics-probability-and-computing/article/abs/number-of-independent-sets-in-a-regular-graph/2D8AF5BAB26AF1763A3EC8771D721DAF
Source: David Galvin, “An upper bound for the number of independent sets in regular graphs”, arXiv:1007.4811 (2010).
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.