The critical number of $I_{1,t}$-free triangle-free binary matroids
Peter Nelson, Kazuhiro Nomoto

TL;DR
This paper proves that simple binary matroids that are both triangle-free and avoid certain intersections with rank-$t$ flats have a bounded critical number, revealing structural limitations in such matroids.
Contribution
The paper establishes that $I_{1,t}$-free and triangle-free binary matroids have a bounded critical number for all $t \,\geq\, 1$, a new structural result.
Findings
Bounded critical number for $I_{1,t}$-free triangle-free binary matroids.
Extension of previous results to all $t \geq 1$.
Structural limitations identified in binary matroids.
Abstract
A simple binary matroid, viewed as a restriction of a finite binary projective geometry , is -free if for any rank- flat of , its intersection with the matroid is not a one-element set. In this paper, we show that the simple -free and triangle-free binary matroids have bounded critical number for any .
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 · Digital Image Processing Techniques · Limits and Structures in Graph Theory
