Pages that link to "Item:Q2476274"
From MaRDI portal
The following pages link to On the minimum number of completely 3-scrambling permutations (Q2476274):
Displaying 7 items.
- The covering threshold of a directed acyclic graph by directed acyclic subgraphs (Q2112584) (← links)
- Perfect sequence covering arrays (Q2302158) (← links)
- Sequence Covering Arrays and Linear Extensions (Q2946063) (← links)
- A note on scrambling permutations (Q4419290) (← links)
- Scrambling permutations and entropy of hypergraphs (Q4870534) (← links)
- Perfect and nearly perfect separation dimension of complete and random graphs (Q6186984) (← links)
- Shattering \(k\)-sets with permutations (Q6615242) (← links)