Unavoidable flats in connected regular matroids
Abstract
This paper proves that every 2-connected regular matroid of sufficiently large rank has a 2-connected graphic flat of large rank. Furthermore, we explicitly determine a list of such unavoidable flats.
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.