Tree automata and pigeonhole classes of matroids. II
From MaRDI portal
Publication:6170523
DOI10.37236/11660arXiv1910.04361OpenAlexW2980045536MaRDI QIDQ6170523
Michael W. Newman, Daryl Funk, Dillon Mayhew
Publication date: 10 August 2023
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.04361
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Combinatorial aspects of matroids and geometric lattices (05B35)
Cites Work
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- Decomposition width of matroids
- Characterizations of transversal and fundamental transversal matroids
- Monadic second-order model-checking on decomposable matroids
- Biased graphs. I: Bias, balance, and gains
- On excluded minors for real-representability
- Biased graphs. II: The three matroids
- Graph minors. X: Obstructions to tree-decomposition
- Lattice path matroids: Enumerative aspects and Tutte polynomials
- Tree automata and pigeonhole classes of matroids. I
- Lattice path matroids: structural properties
- Branch-width, parse trees, and monadic second-order logic for matroids.
- Intersection theorems for systems of sets
- Gammoids and transversal matroids
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Structure in minor-closed classes of matroids
- Enumeration of the Monomials of a Polynomial and Related Complexity Classes
- Varieties of Combinatorial Geometries
- On a combinatorical problem of K. Zarankiewicz
