The following pages link to A note on scrambling permutations (Q4419290):
Displaying 8 items.
- Separation dimension of graphs and hypergraphs (Q300474) (← links)
- The covering threshold of a directed acyclic graph by directed acyclic subgraphs (Q2112584) (← links)
- Covering small subgraphs of (hyper)tournaments with spanning acyclic subgraphs (Q2205125) (← links)
- Perfect sequence covering arrays (Q2302158) (← links)
- On the minimum number of completely 3-scrambling permutations (Q2476274) (← links)
- A group-based structure for perfect sequence covering arrays (Q2692963) (← links)
- Sequence Covering Arrays and Linear Extensions (Q2946063) (← links)
- Perfect and nearly perfect separation dimension of complete and random graphs (Q6186984) (← links)