Labelled well-quasi-order for permutation classes

DOI10.5070/C62359178zbMath1498.05006arXiv2103.08243MaRDI QIDQ5051473

Robert Brignall, Vincent R. Vatter

Publication date: 23 November 2022

Published in: Combinatorial Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2103.08243

zbMATH Keywords

permutation patternswell-quasi-orderlabelled well-quasi-order

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics of partially ordered sets (06A07)

Related Items

Letter Graphs and Geometric Grid Classes of Permutations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding a chain graph in a bipartite permutation graph
• Pattern matching for permutations
• Boundary properties of well-quasi-ordered sets of graphs
• Fundamentals of parameterized complexity
• Induced subgraph isomorphism on proper interval and bipartite permutation graphs
• Well-quasi-order of relabel functions
• Growth rates for subclasses of Av(321)
• Substitution-closed pattern classes
• On partial well-order for monotone grid classes of permutations
• Grid classes and partial well order
• Canonical antichains of unit interval and bipartite permutation graphs
• The X-class and almost-increasing permutations
• Bipartite permutation graphs with application to the minimum buffer size problem
• Partially well-ordered closed sets of permutations
• Labelled induced subgraphs and well-quasi-ordering
• On well-quasi-ordering finite structures with labels
• Graph minors. I. Excluding a forest
• Bipartite permutation graphs
• Proof-theoretic investigations on Kruskal's theorem
• Finiteness theorems for graphs and posets obtained by compositions
• Forbidden subsequences
• Letter graphs and well-quasi-order by induced subgraphs
• Permutations which are the union of an increasing and a decreasing subsequence
• Profile classes and partial well-order for permutations
• Regular closed sets of permutations.
• Linear-time algorithms for counting independent sets in bipartite permutation graphs
• Characterising inflations of monotone grid classes of permutations
• Well-quasi-ordering versus clique-width
• A counterexample regarding labelled well-quasi-ordering
• Explicit enumeration of 321, hexagon-avoiding permutations
• 321-polygon-avoiding permutations and Chebyshev polynomials
• Algorithmic graph theory and perfect graphs
• Generating and enumerating 321-avoiding and skew-merged simple permutations
• Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations
• An infinite antichain of permutations
• Split permutation graphs
• Forbidden substructures and combinatorial dichotomies: WQO and universality
• Two forbidden induced subgraphs and well-quasi-ordering
• Inflations of geometric grid classes of permutations
• A simple proof of a theorem of Schmerl and Trotter for permutations
• The depth of a permutation.
• Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
• Pattern avoidance and the Bruhat order.
• Wreath products of permutation classes
• Linear structure of bipartite permutation graphs and the longest path problem
• Rationality for subclasses of 321-avoiding permutations
• Simple permutations: Decidability and unavoidable substructures
• Grid classes and the Fibonacci dichotomy for restricted permutations
• On Fraissé's order type conjecture
• The theory of well-quasi-ordering: a frequently discovered concept
• Simple permutations and pattern restricted permutations
• Über eine Eigenschaft der ebenen Komplexe
• Classes of graphs without star forests and related graphs
• $2\times 2$ monotone grid classes are finitely based
• Geometric grid classes of permutations
• Automorphism Groups of Geometrically Represented Graphs
• Bipartite induced subgraphs and well-quasi-ordering
• Small permutation classes
• BIPARTITE PERMUTATION GRAPHS ARE RECONSTRUCTIBLE
• Well quasi-order in combinatorics: embeddings and homomorphisms
• A Theorem on Partial Well-Ordering of Sets of Vectors
• Pattern Matching for 321-Avoiding Permutations
• Subgraphs and well‐quasi‐ordering
• Split Graphs Having Dilworth Number Two
• Well-quasi-orderings and sets of finite sequences
• Graph Classes: A Survey
• Foundations of BQO Theory
• The Complexity of Pattern Matching for $321$-Avoiding and Skew-Merged Permutations
• Growth rates of permutation classes: from countable to uncountable
• Letter Graphs and Geometric Grid Classes of Permutations
• Handbook of Enumerative Combinatorics
• Transitiv orientierbare Graphen
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Sorting Using Networks of Queues and Stacks
• Induced subgraphs and well‐quasi‐ordering
• Ordering by Divisibility in Abstract Algebras
• Partial well‐ordering of sets of vectors
• Restricted permutations
• Letter graphs and geometric grid classes of permutations: characterization and recognition
• Letter graphs and geometric grid classes of permutations: characterization and recognition
• Kazhdan-Lusztig polynomials for 321-hexagon-avoiding permutations
• Pattern avoidance in coloured permutations