The structure of $\{U_{2,5}, U_{3,5}\}$-fragile matroids
Ben Clark, Dillon Mayhew, Stefan van Zwam, Geoff Whittle

TL;DR
This paper provides a structural characterization of strictly U_{2,5},U_{3,5}ragile matroids with six GF(5) representations, distinguishing those with and without certain minors, and relates to excluded minors for specific matroid classes.
Contribution
It offers a detailed structural description of U_{2,5},U_{3,5}ragile matroids with six GF(5) representations, aiding in classifying excluded minors for key matroid classes.
Findings
Matroids without X_8, Y_8, Y_8^*ollows from two base matroids by gluing wheels.
Matroids with X_8, Y_8, Y_8^*eature path width 3 and are constructed via elementary operations.
Characterization aids in identifying excluded minors for Hydra-5 and 2-regular matroids.
Abstract
Let be a set of matroids. A matroid is strictly -fragile if has a member of as minor and, for all , at least one of and has no minor in . In this paper we give a structural description of the strictly -fragile matroids that have six inequivalent representations over . Roughly speaking, these matroids fall into two classes. The matroids without an -minor are constructed, up to duality, from one of two matroids by gluing wheels onto specified triangles. On the other hand, those matroids with an -minor can be constructed from a matroid in by repeated application of elementary operations, and are shown to have path width 3. The characterization presented here will be crucial in finding the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Interconnection Networks and Systems · Graph Labeling and Dimension Problems
