On Reverse-Free Codes and Permutations

DOI10.1137/090774835zbMath1227.05249OpenAlexW1978227150MaRDI QIDQ3008020

Angelo Monti, Ida Kantor, Blerina Sinaimeri, Zoltan Fueredi

Publication date: 17 June 2011

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

Full work available at URL: https://semanticscholar.org/paper/e13d385adf61c1e3ef9b59b078903de89eaa4f94

zbMATH Keywords

permutationsextremal combinatoricsordered triples

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Extremal set theory (05D05) Triple systems (05B07) Combinatorial codes (94B25)

Related Items (5)

Large families of permutations of Zn whose pairwise sums are permutations ⋮ New bounds on even cycle creating Hamiltonian paths using expander graphs ⋮ Forbiddance and capacity ⋮ On $k$-Neighbor Separated Permutations ⋮ Path Separation by Short Cycles

This page was built for publication: On Reverse-Free Codes and Permutations