On Matroids on Edge Sets of Graphs with Connected Subgraphs as Circuits

DOI10.2307/2038939MaRDI QIDQ5680160zbMATH OpenOpenAlexFDO

Authors J. M. S. Simões-Pereira

Publication date 1973

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2038939

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05C99)

Cited in

(6)

• On the existence of uncountably many matroidal families
• Infinite subgraphs as matroid circuits
• Construction of matroidal families by partly closed sets
• Matroids from directed graphs
• A primal-dual approach to approximation of node-deletion problems for matroidal properties
• A characterization of matroidal families of multigraphs

This page was built for publication: On Matroids on Edge Sets of Graphs with Connected Subgraphs as Circuits

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