On the existence of uncountably many matroidal families

DOI10.1016/0012-365X(79)90072-4zbMath0427.05024OpenAlexW2056581718MaRDI QIDQ1136773

Rüdiger Schmidt

Publication date: 1979

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(79)90072-4

zbMATH Keywords

digraphsmatroidal family of graphs

Mathematics Subject Classification ID

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

Related Items (3)

Construction of matroidal families by partly closed sets ⋮ Combinatorial analysis. (Matrix problems, choice theory) ⋮ A characterization of matroidal families of multigraphs

Cites Work

• Subgraphs as circuits and bases of matroids
• Parallel concepts in graph theory
• On subgraphs as matroid cells
• Matroidal families of finite connected nonhomeomorphic graphs exist
• On Matroids on Edge Sets of Graphs with Connected Subgraphs as Circuits

This page was built for publication: On the existence of uncountably many matroidal families