ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a simple, finite, undirected graph with NN vertices that is dd-regular, and let i(G)i(G) denote its number of independent sets. The graph N2dKd,d\frac{N}{2d}K_{d,d} is the disjoint union of N2d\frac{N}{2d} copies of the complete bipartite graph Kd,dK_{d,d}. Alon–Kahn conjecture. For every such graph GG,

i(G)≤(2d+1−1)N2d.i(G) \leq \left(2^{d+1}-1\right)^\frac{N}{2d}.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.