A note on scrambling permutations
From MaRDI portal
Publication:4419290
DOI10.1002/rsa.10082zbMath1023.05003OpenAlexW2058968544MaRDI QIDQ4419290
No author found.
Publication date: 31 July 2003
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.10082
Related Items (8)
Separation dimension of graphs and hypergraphs ⋮ Sequence Covering Arrays and Linear Extensions ⋮ Perfect and nearly perfect separation dimension of complete and random graphs ⋮ A group-based structure for perfect sequence covering arrays ⋮ Covering small subgraphs of (hyper)tournaments with spanning acyclic subgraphs ⋮ On the minimum number of completely 3-scrambling permutations ⋮ Perfect sequence covering arrays ⋮ The covering threshold of a directed acyclic graph by directed acyclic subgraphs
This page was built for publication: A note on scrambling permutations
