Excluded minors are almost fragile II: essential elements
Nick Brettell, James Oxley, Charles Semple, Geoff Whittle

TL;DR
This paper advances the understanding of excluded minors in matroid theory by showing that certain large, non-fragile minors are close to having many $N$-essential elements, deepening the structural insights into $P$-representable matroids.
Contribution
It proves that under mild conditions, a large non-$N$-fragile minor is near a minor with many $N$-essential elements, extending previous results on the structure of excluded minors.
Findings
Large minors are close to having many $N$-essential elements.
$M ackslash a,b$ is one element away from a minor with at least $r(M)-2$ $N$-essential elements.
The results deepen the structural understanding of excluded minors for $P$-representable matroids.
Abstract
Let be an excluded minor for the class of -representable matroids for some partial field , let be a -connected strong -stabilizer that is non-binary, and suppose has a pair of elements such that is -connected with an -minor. Suppose also that and is not -fragile. In the prequel to this paper, we proved that is at most five elements away from an -fragile minor. An element in a matroid is -essential if neither nor has an -minor. In this paper, we prove that, under mild assumptions, is one element away from a minor having at least elements that are -essential.
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 · Complexity and Algorithms in Graphs · Optimization and Search Problems
