A Construction of Infinite Sets of Intertwines for Pairs of Matroids

@article{Bonin2010ACO,
  title={A Construction of Infinite Sets of Intertwines for Pairs of Matroids},
  author={Joseph E. Bonin},
  journal={SIAM J. Discret. Math.},
  year={2010},
  volume={24},
  pages={1742-1752}
}
An intertwine of a pair of matroids is a matroid such that it, but none of its proper minors, has minors that are isomorphic to each matroid in the pair. For pairs for which neither matroid can be obtained, up to isomorphism, from the other by taking free extensions, free coextensions, and minors, we construct a family of rank-$k$ intertwines for each sufficiently large integer $k$. We also treat some properties of these intertwines. 
Characterizations of Transversal and Fundamental Transversal Matroids
TLDR
It is shown that fundamental transversal matroids are precisely theMatroids that yield equality in Mason's inequalities and this characterization is deduced from this simpler characterization of fundamental Transversal Matroids due to Brylawski.
Sparse paving matroids, basis-exchange properties, and cyclic flats
We provide evidence for five long-standing, basis-exchange conjectures for matroids by proving them for the enormous class of sparse paving matroids. We also explore the role that these matroids may
AN INTRODUCTION TO TRANSVERSAL MATROIDS
1. Prefatory Remarks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 2. Several Perspectives on Transversal Matroids . . . . . . . . . . . . . . . .

References

SHOWING 1-10 OF 17 REFERENCES
Transversal Matroids and Related Structures
There is an extensive body of literature on the subject of transversal matroids (with the partial transversals of a family of sets as independent sets) and the more general theory of matroids induced
Characterizations of Transversal and Fundamental Transversal Matroids
TLDR
It is shown that fundamental transversal matroids are precisely theMatroids that yield equality in Mason's inequalities and this characterization is deduced from this simpler characterization of fundamental Transversal Matroids due to Brylawski.
The Lattice of Cyclic Flats of a Matroid
Abstract.A flat of a matroid is cyclic if it is a union of circuits. The cyclic flats of a matroid form a lattice under inclusion. We study these lattices and explore matroids from the perspective of
Some open problems on excluding a uniform matroid
Connected Matroids with Symmetric Tutte Polynomials
  • Hongxun Qin
  • Mathematics
    Combinatorics, Probability and Computing
  • 2001
TLDR
This work constructs matroids that are not self-dual, have arbitrarily high connectivity, and yet have symmetric Tutte polynomials.
A characterization of transversal independence spaces
Given independence spaces on the sets E and Y, necessary and sufficient conditions are obtained for the existence of a relation R ⊑ E×Y such that R and the independence space on Y induce the
Combinatorics: Topics, Techniques, Algorithms
Preface 1. What is combinatorics? 2. On numbers and counting 3. Subsets, partitions, permutations 4. Recurrence relations and generating functions 5. The principle of inclusion and exclusion 6. Latin
Matroid theory
TLDR
The current status has been given for all the unsolved problems or conjectures that appear in Chapter 14 and the corrected text is given with the inserted words underlined.
Constructions
  • P. Tichý
  • Philosophy
    Philosophy of Science
  • 1986
The paper deals with the semantics of mathematical notation. In arithmetic, for example, the syntactic shape of a formula represents a particular way of specifying, arriving at, or constructing an
Brylawski, Constructions, in: Theory of Matroids
  • 1986
...
1
2
...