Pages that link to "Item:Q698442"
From MaRDI portal
The following pages link to Partially well-ordered closed sets of permutations (Q698442):
Displaying 21 items.
- Boundary properties of well-quasi-ordered sets of graphs (Q382896) (← links)
- Splittings and Ramsey properties of permutation classes (Q477770) (← links)
- Schur-positive sets of permutations via products and grid classes (Q517354) (← links)
- Grid classes and partial well order (Q645965) (← links)
- Embedding dualities for set partitions and for relational structures (Q648966) (← links)
- Finding regular insertion encodings for permutation classes (Q765858) (← links)
- Posets and permutations in the duplication-loss model: minimal permutations with \(d\) descents (Q974742) (← links)
- Regular closed sets of permutations. (Q1426439) (← links)
- On the least exponential growth admitting uncountably many closed permutation classes (Q1885903) (← links)
- Forbidden substructures and combinatorial dichotomies: WQO and universality (Q2275384) (← links)
- WQO is decidable for factorial languages (Q2407108) (← links)
- Rationality for subclasses of 321-avoiding permutations (Q2422212) (← links)
- Finitely labeled generating trees and restricted permutations (Q2457348) (← links)
- Pattern classes of permutations via bijections between linearly ordered sets (Q2462323) (← links)
- Simple permutations: Decidability and unavoidable substructures (Q2474234) (← links)
- Simple permutations and pattern restricted permutations (Q2570099) (← links)
- Unsplittable classes of separable permutations (Q2629491) (← links)
- Geometric grid classes of permutations (Q2849033) (← links)
- Labelled well-quasi-order for permutation classes (Q5051473) (← links)
- (Q5089220) (← links)
- Enumeration Schemes for Restricted Permutations (Q5448994) (← links)