Partial matroid representations
From MaRDI portal
A theorem on the 3-connectivity of matroids is given, which has many new and old connectivity results as corollaries. E.g. if M' is a 3-connected proper minor on at least four elements of a 3-connected matroid M then M has a 3-connected minor M which has M' as a proper minor and has at most 3 additional elements beyond those of M'.
Recommendations
Cites work
- A characterization of 3-connected graphs containing a given graph
- A Multiple Exchange Property for Bases
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
- Alpha-balanced graphs and matrices and GF(3)-representability of matroids
- Connectivity in Matroids
- Decomposition of regular matroids
- scientific article; zbMATH DE number 3133252 (Why is no real title available?)
- scientific article; zbMATH DE number 3182201 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3598496 (Why is no real title available?)
- scientific article; zbMATH DE number 3236772 (Why is no real title available?)
- scientific article; zbMATH DE number 3308985 (Why is no real title available?)
- Lectures on matroids
- Minimum partition of a matroid into independent subsets
- On matroid connectivity
- On Representatives of Subsets
- On the efficiency of representability tests for matroids
- Planarity and duality of finite and infinite graphs
- Systems of distinct representatives and linear algebra
- The dependence graph for bases in matroids
Cited in
(29)- A decomposition theory for matroids. II. Minimal violation matroids
- A decomposition theory for matroids. III. Decomposition conditions
- On chains of 3-connected matroids
- A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs
- Decomposition and optimization over cycles in binary matroids
- Finding a small 3-connected minor maintaining a fixed minor and a fixed element
- A decomposition theory for matroids. V: Testing of matrix total unimodularity
- On fixing elements in matroid minors
- A short proof of the Truemper-Tseng theorem on max-flow min-cut matroids
- Extensions of Tutte's wheels-and-whirls theorem
- A decomposition theory for matroids. VII: Analysis of minimal violation matrices
- A decomposition theory for matroids. VI: Almost regular matroids
- On the minor-minimal 3-connected matroids having a fixed minor.
- On the structure of 3-connected matroids and graphs
- On packing minors into connected matroids
- A decomposition of the matroids with the max-flow min-cut property
- Characterizing matroids whose bases form graphic delta-matroids
- Matroid 3-connectivity and branch width
- A decomposition theory for matroids. IV: Decomposition of graphs
- Characterizations of Disconnected Matroids
- Decomposition of 3-connected representable matroids
- On sign-representable matroids
- Some Local Extremal Connectivity Results for Matroids
- Intertwining connectivities in representable matroids
- Quantum and classical query complexities for determining connectedness of matroids
- A chain theorem for 4-connected matroids
- On matroid minors that guarantee their duals as minors
- A decomposition theory for matroids. I: General results
- The structure of bases in bicircular matroids
This page was built for publication: Partial matroid representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2266019)
