Scrambling permutations and entropy of hypergraphs
From MaRDI portal
Publication:4870534
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1098-2418(199603)8:2<97::AID-RSA1>3.0.CO;2-J" /><97::AID-RSA1>3.0.CO;2-J 10.1002/(SICI)1098-2418(199603)8:2<97::AID-RSA1>3.0.CO;2-JzbMath0842.05002OpenAlexW1574826618MaRDI QIDQ4870534
Publication date: 20 March 1996
Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199603)8:2<97::aid-rsa1>3.0.co;2-j
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: Scrambling permutations and entropy of hypergraphs
