Characterizations of transversal and fundamental transversal matroids
Summary: A result of Mason, as refined by Ingleton, characterizes transversal matroids as the matroids that satisfy a set of inequalities that relate the ranks of intersections and unions of nonempty sets of cyclic flats. We prove counterparts, for fundamental transversal matroids, of this and other characterizations of transversal matroids. In particular, we show that fundamental transversal matroids are precisely the matroids that yield equality in Mason's inequalities and we deduce a characterization of fundamental transversal matroids due to Brylawski from this simpler characterization.
- scientific article; zbMATH DE number 15361
- scientific article; zbMATH DE number 4025457
- A note on binary fundamental transversal matroids
- Transversal and cotransversal matroids via their representations
- Extensions and presentations of transversal matroids
- Basis-transitive matroids
- On the number of transversal matroids
- A rough set approach to the characterization of transversal matroids
- On the quasi-transversals of a matroid
- Conditions for representability and transversality of matroids
- Transversal lattices
- On finding some new excluded minors for gammoids
- Transversal matroids and strata on Grassmannians
- Tree automata and pigeonhole classes of matroids. I
- On power ideals of transversal matroids and their ``parking functions
- A module-theoretic approach to matroids
- Semidirect sums of matroids
- Note on ``A rough set approach to the characterization of transversal matroids
- scientific article; zbMATH DE number 4025457 (Why is no real title available?)
- scientific article; zbMATH DE number 4097397 (Why is no real title available?)
- scientific article; zbMATH DE number 15361 (Why is no real title available?)
- Extensions and presentations of transversal matroids
- A note on binary fundamental transversal matroids
- A rough set approach to the characterization of transversal matroids
- Presentations of transversal valuated matroids
- Connectivity gaps among matroids with the same enumerative invariants
- Tree automata and pigeonhole classes of matroids. II
- A construction that preserves the configuration of a matroid, with applications to lattice path matroids
- An infinite family of excluded minors for strong base-orderability
This page was built for publication: Characterizations of transversal and fundamental transversal matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q540111)