Fractal classes of matroids
From MaRDI portal
Abstract: A minor-closed class of matroids is (strongly) fractal if the number of n-element matroids in the class is dominated by the number of n-element excluded minors. We conjecture that when K is an infinite field, the class of K-representable matroids is strongly fractal. We prove that the class of sparse paving matroids with at most k circuit-hyperplanes is a strongly fractal class when k is at least three. The minor-closure of the class of spikes with at most k circuit-hyperplanes (with k>4) satisfies a strictly weaker condition: the number of 2t-element matroids in the class is dominated by the number of 2t-element excluded minors. However, there are only finitely many excluded minors with ground sets of odd size.
Recommendations
Cites work
- scientific article; zbMATH DE number 3133252 (Why is no real title available?)
- scientific article; zbMATH DE number 729555 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- Biased graphs. II: The three matroids
- Graph minors. XX: Wagner's conjecture
- On excluded minors for real-representability
- On the complex-representable excluded minors for real-representability
- Solving Rota's conjecture
- When excluding one matroid prevents infinite antichains
Cited in
(5)
This page was built for publication: Fractal classes of matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2020029)