Completeness conjecture at the extremal parameters for planar factor-critical graphs
Statement
Let be a minimal --factor-critical planar graph, and let be one of the two values or .
Completeness conjecture. If is a minimal --factor-critical graph, then is a complete graph.
The conjecture is motivated by examples attaining both degree bounds in the source's planar minimum-degree theorem, including complete graphs. Its general status is not resolved 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.