Zaks's conjecture on perfect matchings in connected graphs
Statement
Let and be integers, and let be a matchable -connected graph with vertices. Zaks's conjecture. Every such graph satisfies
moreover, infinitely many graphs attain equality. The conjecture is disproved by the counterexamples constructed in the paper.
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.