Small degree vertices in minimal bricks

Bricks are 3-connected bicritical graphs. Together with braces, they arise in matching theory as building blocks for matching covered graphs.We prove that every minimal brick on n vertices has at least vertices of degree at most 4. This proves a relaxed version of a conjecture of Norine and Thomas, which suggests that every minimal brick has some fixed positive fraction of vertices of degree 3.