Mathematics > Combinatorics
arXiv:2606.16064 (math)
[Submitted on 14 Jun 2026]
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.
Submission history
From: Yiwei Ge [view email]
[v1]
Sun, 14 Jun 2026 23:40:24 UTC (72 KB)
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Code, Data, Media
Code, Data and Media Associated with this Article
Demos
Demos
Related Papers
Recommenders and Search Tools
About arXivLabs
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.























