Scrambling permutations and entropy of hypergraphs

DOI10.1002/(SICI)1098-2418(199603)8:2%3C97::AID-RSA1%3E3.0.CO;2-JMaRDI QIDQ4870534zbMATH OpenOpenAlexFDO

Authors Zoltán Füredi

Publication date 20 March 1996

Full work available at URL https://doi.org/10.1002/(sici)1098-2418(199603)8:2%3C97::aid-rsa1%3E3.0.co;2-j

zbMATH Keywords

entropyhypergraphpermutationsproblems

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Hypergraphs (05C65)

Recommendations

• On the minimum number of completely 3-scrambling permutations
• A note on scrambling permutations
• On the minimum number of completely 3-scrambling permutations
• On the discrepancy of 3 permutations

Cited in

(16)

• Fast scramblers, horizons and expander graphs
• Suitable sets of permutations, packings of triples, and Ramsey's theorem
• The covering threshold of a directed acyclic graph by directed acyclic subgraphs
• Covering small subgraphs of (hyper)tournaments with spanning acyclic subgraphs
• Perfect sequence covering arrays
• On the minimum number of completely 3-scrambling permutations
• A group-based structure for perfect sequence covering arrays
• Sequence Covering Arrays and Linear Extensions
• Separation dimension of graphs and hypergraphs
• On the minimum number of completely 3-scrambling permutations
• On the discrepancy of 3 permutations
• A note on scrambling permutations
• Constructions and nonexistence results for suitable sets of permutations
• Perfect and nearly perfect separation dimension of complete and random graphs
• Shattering k-sets with permutations
• The three-permutations problem

This page was built for publication: Scrambling permutations and entropy of hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4870534)