Summary: This sequel to \textit{S. H. Afzali Borujeni} et. al. [``Finitary and cofinitary gammoids, Discrete Appl. Math. (to appear), \url{doi:10.1016/j.dam.2015.07.030}] considers minors and duals of infinite gammoids. We prove that the class of gammoids defined by digraphs not containing a certain type of substructure, called an outgoing comb, is minor-closed. Also, we prove that finite-rank minors of gammoids are gammoids. Furthermore, the topological gammoids of \textit{J. Carmesin} [``Topological infinite gammoids, and a new Menger-type theorem for infinite graphs, Preprint, \url{arXiv:1404.0151}] are proved to coincide, as matroids, with the finitary gammoids. A corollary is that topological gammoids are minor-closed. It is a well-known fact that the dual of any finite strict gammoid is a transversal matroid. The class of strict gammoids defined by digraphs not containing alternating combs, introduced in Afzali Borujeni et. al. [loc. cit.], contains examples which are not dual to any transversal matroid. However, we describe the duals of matroids in this class as a natural extension of transversal matroids. While finite gammoids are closed under duality, we construct a strict gammoid that is not dual to any gammoid.
- Abstract linear dependence
- Applications of Menger's graph theorem
- Applications of the notion of independence to problems of combinatorial analysis
- Axioms for infinite matroids
- Ein Neuer Beweis Eines Mengerschen Satzes
- Exchange systems, matchings, and transversals
- Finitary and cofinitary gammoids
- Finite connectivity in infinite matroids
- Gammoids and transversal matroids
- Graph theory
- scientific article; zbMATH DE number 3590289 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- Infinite gammoids
- Matroids with an infinite circuit-cocircuit intersection
- On a Class of Matroids Arising From Paths in Graphs
- Presentations of Transversal Matroids
- SOME RESULTS ON TRANSVERSAL MATROIDS AND CONSTRUCTIONS FOR IDENTICALLY SELF-DUAL MATROIDS
- The Linking of Sets in Graphs
- Thin sums matroids and duality
- Topological infinite gammoids, and a new Menger-type theorem for infinite graphs
- Transversals and matroid partition
- When do two planted graphs have the same cotransversal matroid?
- On finding some new excluded minors for gammoids
- Note on the gammoids arising from undirected graphs
- Duality respecting representations and compatible complexity measures for gammoids
- Infinite gammoids
- Finitary and cofinitary gammoids
- Undirected strict gammoids
- The Lovász-Cherkassky theorem in infinite graphs
- Transversal and cotransversal matroids via their representations
This page was built for publication: Infinite gammoids: minors and duality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q907227)