On the connectivity function of a matroid

DOI10.1016/0095-8956(88)90052-4MaRDI QIDQ1119657zbMATH OpenOpenAlexFDO

Authors Paul Seymour

Publication date 1988

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0095-8956(88)90052-4

zbMATH Keywords

matroidconnectivity function

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• On the connectivity function of a binary matroid
• Finite connectivity in infinite matroids
• On matroids with the same connectivity function
• Matroids having the same connectivity function
• scientific article; zbMATH DE number 4160776

Cited in

(18)

• The reconstruction of a matroid from its connectivity function
• Expansion and contraction functors on matriods
• Finite connectivity in infinite matroids
• Recognising graphic and matroidal connectivity functions
• Connectivity of single-element coextensions of a binary matroid
• Sprague-Grundy function of matroids and related hypergraphs
• Connectedness of matroids
• Characterizations of Disconnected Matroids
• Connectivity functions and polymatroids
• Matroids having the same connectivity function
• On matroids with the same connectivity function
• Prime vertex-minors of a prime graph
• On the connectivity function of a binary matroid
• A new matroid constructed by the rank function of a matroid
• Vertex-minors of graphs: a survey
• Matroid connectivity and singularities of configuration hypersurfaces
• Some extremal connectivity results for matroids
• An improved algorithm for finding tree decompositions of small width

This page was built for publication: On the connectivity function of a matroid

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