Grid classes and partial well order
From MaRDI portal
Publication:645965
DOI10.1016/j.jcta.2011.08.005zbMath1314.06002arXiv0906.3723OpenAlexW2005287322MaRDI QIDQ645965
Publication date: 11 November 2011
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0906.3723
Related Items
Labelled well-quasi-order for permutation classes, Boundary properties of well-quasi-ordered sets of graphs, On partial well-order for monotone grid classes of permutations, Juxtaposing Catalan permutation classes with monotone ones, Unnamed Item, Geometric grid classes of permutations, Well-quasi-order for permutation graphs omitting a path and a clique
Cites Work
- Unnamed Item
- Excluded permutation matrices and the Stanley-Wilf conjecture
- On partial well-order for monotone grid classes of permutations
- Partially well-ordered closed sets of permutations
- Graph minors. XX: Wagner's conjecture
- Finiteness theorems for graphs and posets obtained by compositions
- Profile classes and partial well-order for permutations
- Minimal antichains in well-founded quasi-orders with an application to tournaments
- Decomposing simple permutations, with enumerative consequences
- Grid classes and the Fibonacci dichotomy for restricted permutations
- Simple permutations and pattern restricted permutations
- Geometric grid classes of permutations
- The enumeration of permutations avoiding 2143 and 4231
- A Survey of Simple Permutations
- Small permutation classes
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- Ordering by Divisibility in Abstract Algebras