Alon–Kahn conjecture on independent sets in regular graphs
Statement
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 ,
Kahn proved this bound for regular bipartite graphs, while the conjecture asserts it for all regular graphs; the general case remains open in the supplied text.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.