Linear degree-three-vertex conjecture for minimal bricks
Statement
A brick is a graph satisfying the usual matching-theoretic brick conditions, and a minimal brick is a brick minimal with respect to the relevant brick-preserving reduction. For a graph , write for its vertex set and let denote its number of vertices.
Linear degree-three-vertex conjecture. There exists such that every minimal brick has at least
vertices of degree three.
This conjecture strengthens the preceding result that every minimal brick has at least three vertices of degree three. Even the weaker assertion that every brick has at least four vertices of degree three is described as requiring new ideas or a substantial refinement of the authors' techniques.
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.