On uniquely \(k\)-determined permutations
From MaRDI portal
Publication:2477375
DOI10.1016/j.disc.2007.03.079zbMath1134.05002arXivmath/0610333MaRDI QIDQ2477375
Sergey Kitaev, Sergei V. Avgustinovich
Publication date: 13 March 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0610333
05A05: Permutations, words, matrices
05C20: Directed graphs (digraphs), tournaments
05C45: Eulerian and Hamiltonian graphs
Related Items
The joint distribution of consecutive patterns and descents in permutations avoiding 3-1-2, The solution to the partition reconstruction problem
Uses Software
Cites Work
- A spectral approach to consecutive pattern-avoiding permutations
- Crucial words and the complexity of some extremal problems for sets of prohibited words
- Colouring prime distance graphs
- Universal cycles for combinatorial structures
- Consecutive patterns in permutations
- Multi-avoidance of generalised patterns
- Partially ordered generalized patterns
- On Unavoidable Sets of Word Patterns
- Systematic generation of ordered sequences using recurrence relations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item