2018/06/27 by Meenu Mariya Jose, Jose, Meenu Mariya, Dillon Mayhew +1
Computer Science · Mathematics · #Advanced Algebra and Logic #Advanced Combinatorial Mathematics #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics
paper · pdf · doi:10.48550/arxiv.1806.10260
openalex publication_date 2018/06/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.