Matroids having the same connectivity function
From MaRDI portal
Publication:1332425
Recommendations
- On the connectivity function of a matroid
- On matroids with the same connectivity function
- On the connectivity function of a binary matroid
- On binary identically self-dual matroids
- A generalization to bases common to r binary matroids of the weighted matrix-tree theorem in the case when the weights are Boolean
- Proof of a conjecture on matroid base graphs
- On the basis graph of a matroid of arbitrary cardinality
- scientific article; zbMATH DE number 2187686
- An extremal problem for non-separable matroids
- Basis pair graphs of transversal matroids are connected
Cites work
Cited in
(13)- On matroid connectivity
- The reconstruction of a matroid from its connectivity function
- When do two planted graphs have the same cotransversal matroid?
- On matroids with the same connectivity function
- Intertwining connectivity in matroids
- On the connectivity function of a matroid
- An extension of elementary bipartite graphs to matroid pairs and its characterization
- On the connectivity function of a binary matroid
- Finite connectivity in infinite matroids
- Connectedness of matroids
- Connectivity functions and polymatroids
- Connectivity gaps among matroids with the same enumerative invariants
- scientific article; zbMATH DE number 4160776 (Why is no real title available?)
This page was built for publication: Matroids having the same connectivity function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1332425)
