On the structure of dense triangle-free binary matroids
Rutger Campbell, Jim Geelen, Peter Nelson

TL;DR
This paper provides a detailed structural characterization of dense triangle-free binary matroids, showing that sufficiently large such matroids have a critical number of at most 2.
Contribution
It offers an exact structural description of dense triangle-free binary matroids and establishes a size threshold for their critical number.
Findings
Dense triangle-free binary matroids with size above a specific threshold have critical number at most 2.
The paper characterizes the structure of such matroids precisely.
It advances understanding of the interplay between density, triangle-freeness, and critical number in binary matroids.
Abstract
We prove, by means of an exact structural description, that every simple triangle-free binary matroid with has critical number at most .
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 · Limits and Structures in Graph Theory · Graph Labeling and Dimension Problems
