ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For each k⩾1k\geqslant 1, let NkN_k be an integer, and let GG be a minimal kk-extendable bipartite graph of order nn and size ∣E∣|E|. Eventual size bound conjecture. There exists an integer Nk⩽4k2+2kN_k\leqslant 4k^2+2k such that every such graph on NkN_k or more vertices satisfies

∣E∣⩽(2k+1)(n−2k)2.|E|\leqslant \frac{(2k+1)(n-2k)}{2}.

The authors note that they can construct small counterexamples and therefore impose the lower bound on the order; the conjecture's resolution is not supplied in the text provided.

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.