The unbreakable quasi-graphic matroids
Abstract
A matroid M is unbreakable if it is connected and M/F is connected for every flat F of M . Oxley and Pfeil characterized the unbreakable graphic matroids, and Fife, Mayhew, Oxley, and Semple characterized the graphs underlying 3-connected unbreakable frame matroids. We extend the latter result by giving a complete characterization of the 3-connected unbreakable quasi-graphic matroids. As a special case we obtain a characterization of the 3-connected lifted-graphic matroids.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.