Kahn's independent-set bound for regular graphs
Statement
Let be a -regular graph with vertices, and let denote its number of independent sets. Alon and Kahn's conjecture. One has
This formalized the proposed extremal role of a disjoint union of copies of ; the conjecture was subsequently resolved by Sah, who proved the relevant upper bound.
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.