ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a minimal kk-{1,2}\{1,2\}-factor-critical planar graph, and let tt be one of the two values kk or k+1k+1.

Completeness conjecture. If GG is a minimal tt-{1,2}\{1,2\}-factor-critical graph, then GG 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 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.