Minimal bricks have many vertices of small degree
Abstract
We prove that every minimal brick on n vertices has at least n/9 vertices of degree at most 4.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.