On a Class of Matroids Arising From Paths in Graphs
From MaRDI portal
Publication:5655373
DOI10.1112/plms/s3-25.1.55zbMath0244.05014OpenAlexW2063592986MaRDI QIDQ5655373
Publication date: 1972
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/plms/s3-25.1.55
Combinatorial aspects of matroids and geometric lattices (05B35) Directed graphs (digraphs), tournaments (05C20)
Related Items
Finitary and cofinitary gammoids ⋮ Flag arrangements and triangulations of products of simplices ⋮ Matroids and linking systems ⋮ Tabloides ⋮ On finding some new excluded minors for gammoids ⋮ Presentations of transversal valuated matroids ⋮ Infinite gammoids: minors and duality ⋮ Duality respecting representations and compatible complexity measures for gammoids ⋮ Infinite gammoids ⋮ Gammoids, pseudomodularity and flatness degree ⋮ The Alpha Function of a Matroid-I. Transversal Matroids ⋮ Gammoids and transversal matroids ⋮ Applications of matroids in electric network theory ⋮ A class of matroids derived from saturated chain partitions of partially ordered sets ⋮ STRONGLY MINIMAL STEINER SYSTEMS I: EXISTENCE ⋮ A characterization of the ternary matroids with no \(M(K_ 4)\)-minor ⋮ A Combinatorial Proof of the All Minors Matrix Tree Theorem
