The structure of I₄-free and triangle-free binary matroids
From MaRDI portal
Publication:5093589
Abstract: A simple binary matroid is called -free if none of its rank-4 flats are independent sets. These objects can be equivalently defined as the sets of points in for which is not a basis of for any four-dimensional flat . We prove a decomposition theorem that exactly determines the structure of all -free and triangle-free matroids. In particular, our theorem implies that the -free and triangle-free matroids have critical number at most .
Recommendations
- The structure of claw-free binary matroids
- The critical number of dense triangle-free binary matroids
- The structure of binary matroids with no induced claw or Fano plane restriction
- Dense binary \(\mathrm{PG}(t-1,2)\)-free matroids have critical number \(t-1\) or \(t\)
- Internally 4-connected binary matroids with every element in three triangles
Cites work
- scientific article; zbMATH DE number 3747156 (Why is no real title available?)
- scientific article; zbMATH DE number 1229718 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- scientific article; zbMATH DE number 4183452 (Why is no real title available?)
- A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codes
- Quasiperfect linear binary codes with distance 4 and complete caps in projective geometry
- The critical number of dense triangle-free binary matroids
- The structure of binary matroids with no induced claw or Fano plane restriction
- The structure of claw-free binary matroids
Cited in
(2)
This page was built for publication: The structure of \(I_4\)-free and triangle-free binary matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5093589)