An extremal problem of \(d\) permutations containing every permutation of every \(t\) elements
From MaRDI portal
Publication:1126218
DOI10.1016/0012-365X(95)00087-DzbMath0860.05001MaRDI QIDQ1126218
Publication date: 21 April 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (6)
Sequence Covering Arrays and Linear Extensions ⋮ 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
Cites Work
This page was built for publication: An extremal problem of \(d\) permutations containing every permutation of every \(t\) elements