When do two planted graphs have the same cotransversal matroid?
Combinatorics
2010-02-21 v3
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.
Keywords
Cite
@article{arxiv.0809.4250,
title = {When do two planted graphs have the same cotransversal matroid?},
author = {Federico Ardila and Amanda Ruiz},
journal= {arXiv preprint arXiv:0809.4250},
year = {2010}
}
Comments
12 pages, 7 figures; expository changes