Grid classes and partial well order

DOI10.1016/j.jcta.2011.08.005zbMath1314.06002arXiv0906.3723MaRDI QIDQ645965

Robert Brignall

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

zbMATH Keywords

infinite antichains; partial well-order; grid classes; permutation classes

Mathematics Subject Classification ID

05A05: Permutations, words, matrices

06A07: Combinatorics of partially ordered sets

Related Items

Unnamed Item, Labelled well-quasi-order for permutation classes, Boundary properties of well-quasi-ordered sets of graphs, Juxtaposing Catalan permutation classes with monotone ones, On partial well-order for monotone grid classes of permutations, Well-quasi-order for permutation graphs omitting a path and a clique, Geometric grid classes of permutations

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