Well-quasi-ordering in lattice path matroids
Combinatorics
2018-06-28 v1
Abstract
Lattice path matroids form a subclass of transversal matroids and were introduced by Bonin, de Mier and Noy. Transversal matroids are not well-quasi-ordered, even when the branch-width is restricted. Though lattice path matroids are not well-quasi-ordered, we prove that lattice path matroids of bounded branch-width are well-quasi-ordered.
Keywords
Cite
@article{arxiv.1806.10260,
title = {Well-quasi-ordering in lattice path matroids},
author = {Meenu Mariya Jose and Dillon Mayhew},
journal= {arXiv preprint arXiv:1806.10260},
year = {2018}
}