ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A brick is a 3-connected bicritical graph. A brick GG is minimal if G−eG-e is not a brick for every edge ee of GG. Write V(G)V(G) for its vertex set and let ∣V(G)∣|V(G)| denote the number of vertices.

Norine–Thomas conjecture. There exists a constant α>0\alpha>0 such that every minimal brick GG has at least α∣V(G)∣\alpha|V(G)| 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 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.