Pages that link to "Item:Q4870534"
From MaRDI portal
The following pages link to Scrambling permutations and entropy of hypergraphs (Q4870534):
Displaying 15 items.
- Separation dimension of graphs and hypergraphs (Q300474) (← links)
- Constructions and nonexistence results for suitable sets of permutations (Q507826) (← links)
- The three-permutations problem (Q908913) (← links)
- Fast scramblers, horizons and expander graphs (Q1795837) (← links)
- Suitable sets of permutations, packings of triples, and Ramsey's theorem (Q2011141) (← 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)
- On the discrepancy of 3 permutations (Q3977077) (← links)
- A note on scrambling permutations (Q4419290) (← links)
- Perfect and nearly perfect separation dimension of complete and random graphs (Q6186984) (← links)
- Shattering \(k\)-sets with permutations (Q6615242) (← links)