Simple permutations: Decidability and unavoidable substructures
Authors:
- Robert BrignallRBRobert Brignall
- Nik RuškucNRNik Ruškuc
- Vincent VatterVVVincent Vatter
- 1 February 2008
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 391 (1-2) , 150-163
Abstract
No abstract availableKeywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Simple permutations and pattern restricted permutationsDiscrete Mathematics, 2005
- Sorting ClassesThe Electronic Journal of Combinatorics, 2005
- Regular closed sets of permutationsTheoretical Computer Science, 2003
- Partially Well-Ordered Closed Sets of PermutationsOrder, 2002
- Minimal Antichains in Well-founded Quasi-orders with an Application to TournamentsJournal of Combinatorial Theory, Series B, 2000
- Restricted permutationsDiscrete Mathematics, 1999
- Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structuresDiscrete Mathematics, 1993
- Criterion for smoothness of Schubert varieties in Sl(n)/BProceedings of the Indian Academy of Sciences - Section A, 1990
- On Intervals in Relational StructuresMathematical Logic Quarterly, 1980
- Ordering by Divisibility in Abstract AlgebrasProceedings of the London Mathematical Society, 1952