Matroids having the same connectivity function
From MaRDI portal
Publication:1332425
DOI10.1016/0012-365X(94)90380-8zbMATH Open0806.05025MaRDI QIDQ1332425FDOQ1332425
Authors: Manoel Lemos 
Publication date: 14 February 1995
Published in: Discrete Mathematics (Search for Journal in Brave)
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)
- The reconstruction of a matroid from its connectivity function
- Connectivity gaps among matroids with the same enumerative invariants
- Intertwining connectivity in matroids
- Finite connectivity in infinite matroids
- When do two planted graphs have the same cotransversal matroid?
- Connectedness of matroids
- Connectivity functions and polymatroids
- Title not available (Why is that?)
- On the connectivity function of a matroid
- An extension of elementary bipartite graphs to matroid pairs and its characterization
- On matroids with the same connectivity function
- On the connectivity function of a binary matroid
- On matroid connectivity
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)
