ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A minimal brick is a brick GG such that G−eG-e is not a brick for every edge e∈E(G)e\in E(G). A brick is a bicritical and 33-connected graph, and a graph is bicritical if G−{u,v}G-\{u,v\} has a perfect matching for every pair of distinct vertices uu and vv. Write V(G)V(G) for the vertex set of GG and let ∣V(G)∣|V(G)| denote its size. Norine and Thomas's conjecture. There is an α>0\alpha>0 such that every minimal brick GG contains at least α∣V(G)∣\alpha |V(G)| vertices of degree 33. This strengthens the known result that every minimal brick contains at least three vertices of degree 33, and predicts a linear proportion of minimum-degree vertices; whether such an α\alpha 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 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.