Permutations resilient to deletions

DOI10.1007/s00026-018-0403-3zbMath1405.94128OpenAlexW2895246045MaRDI QIDQ1710995

Noga Alon, Steve Butler, Utkrisht C. Rajkumar, Ronald L. Graham

Publication date: 24 January 2019

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00026-018-0403-3

zbMATH Keywords

permutationsrecoverydeletion channeldouble path graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Combinatorial codes (94B25)

Related Items

High-girth near-Ramanujan graphs with localized eigenvectors

Cites Work

• Unnamed Item
• The Moore bound for irregular graphs
• Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs