Determining the minimum rank of matroids whose basis graph is common

DOI10.1016/J.ENDM.2008.06.028MaRDI QIDQ5300997zbMATH OpenOpenAlexFDO

Authors Masahiro Hachimori, Hiroshi Kurata, Tadashi Sakuma

Publication date 28 June 2013

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2008.06.028

zbMATH Keywords

Euclidean distance matrixmatroidmatroid basis graph

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• The minimum rank of matrices and the equivalence class graph
• Matroids and the minimum rank problem for matrix patterns
• On the minimum vector rank of multigraphs
• On the number of common bases of two matroids
• On the minimum semidefinite rank of a simple graph
• Finding all common bases in two matroids
• On the graph complement conjecture for minimum rank
• On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
• An upper bound for the minimum rank of a graph
• Matroids with few non-common bases

Cites work

• A characterization of complete matroid base graphs
• A Graphical Representation of Matroids
• A lower bound on connectivities of matroid base graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Families of matroids induced by classes of graphs
• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• Matroid basis graphs. I
• Matroid basis graphs. II
• Paths and cycles in matroid base graphs
• Properties of Euclidean and non-Euclidean distance matrices

Cited in

(1)

• Finding all common bases in two matroids

This page was built for publication: Determining the minimum rank of matroids whose basis graph is common

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