Norine–Thomas linear-density conjecture for degree-three vertices in minimal bricks
Statement
A brick is a 3-connected bicritical graph. A brick is minimal if is not a brick for every edge of . Write for its vertex set and let denote the number of vertices.
Norine–Thomas conjecture. There exists a constant such that every minimal brick has at least vertices of degree three.
Norine and Thomas established that every minimal brick has at least three vertices of degree three and conjectured a positive linear proportion. The statement remains open according to the supplied context.
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.