The eventual size bound conjecture for minimal k-extendable bipartite graphs
Statement
For each , let be an integer, and let be a minimal -extendable bipartite graph of order and size . Eventual size bound conjecture. There exists an integer such that every such graph on or more vertices satisfies
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.