On a Class of Matroids Arising From Paths in Graphs

DOI10.1112/PLMS/S3-25.1.55MaRDI QIDQ5655373zbMATH OpenOpenAlexFDO

Authors John Mason

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

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Combinatorial aspects of matroids and geometric lattices (05B35)

Cited in

(19)

• The no-meet matroid
• Presentations of transversal valuated matroids
• Duality respecting representations and compatible complexity measures for gammoids
• Finitary and cofinitary gammoids
• Matroids and linking systems
• Tabloides
• Infinite gammoids: minors and duality
• Gammoids, pseudomodularity and flatness degree
• The Alpha Function of a Matroid-I. Transversal Matroids
• Flag arrangements and triangulations of products of simplices
• STRONGLY MINIMAL STEINER SYSTEMS I: EXISTENCE
• On finding some new excluded minors for gammoids
• Infinite gammoids
• A class of matroids derived from saturated chain partitions of partially ordered sets
• Fast algorithms via dynamic-oracle matroids
• Applications of matroids in electric network theory
• Gammoids and transversal matroids
• A characterization of the ternary matroids with no \(M(K_ 4)\)-minor
• A Combinatorial Proof of the All Minors Matrix Tree Theorem

This page was built for publication: On a Class of Matroids Arising From Paths in Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5655373)