ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A brace is a bipartite matching covered graph with no nontrivial barrier. A 3-line is an edge whose two endpoints have degree 3. Let GG be a minimal brace with at least 66 vertices. 3-line conjecture. GG has a 3-line. This conjecture extends the known minimum-degree result for minimal braces: Lou proved that every minimal brace on at least 66 vertices has minimum degree 33, and also established a lower bound on the number of cubic vertices. It remains open whether every such graph necessarily contains an edge joining two cubic vertices.

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.