When do two planted graphs have the same cotransversal matroid?

Abstract

Cotransversal matroids are a family of matroids that arise from planted graphs. We prove that two planted graphs give the same cotransversal matroid if and only if they can be obtained from each other by a series of local moves.

arXiv comment12 pages, 7 figures; expository changes

Cited by in corpus (2)

• Basis shape loci and the positive Grassmannian
• Todxs cuentan: cultivating diversity in combinatorics