Norine and Thomas's linear abundance conjecture for degree-3 vertices in minimal bricks
Statement
A minimal brick is a brick such that is not a brick for every edge . A brick is a bicritical and -connected graph, and a graph is bicritical if has a perfect matching for every pair of distinct vertices and . Write for the vertex set of and let denote its size. Norine and Thomas's conjecture. There is an such that every minimal brick contains at least vertices of degree . This strengthens the known result that every minimal brick contains at least three vertices of degree , and predicts a linear proportion of minimum-degree vertices; whether such an exists is unresolved in the supplied source.
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.