Maximum Size of Reverse-Free Sets of Permutations

DOI10.1137/120888168zbMath1268.05225arXiv1208.2847OpenAlexW2023526708MaRDI QIDQ5300491

Josef Cibulka

Publication date: 27 June 2013

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

set of permutationsextremal combinatoricsreverse-free code

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Extremal set theory (05D05)

Related Items (7)

Large families of permutations of Zn whose pairwise sums are permutations ⋮ New bounds on even cycle creating Hamiltonian paths using expander graphs ⋮ Ramsey numbers of ordered graphs ⋮ Interlocked Permutations ⋮ On $k$-Neighbor Separated Permutations ⋮ Ramsey numbers of interval 2-chromatic ordered graphs ⋮ Path Separation by Short Cycles

This page was built for publication: Maximum Size of Reverse-Free Sets of Permutations