The Multiple-Orientability Thresholds for Random Hypergraphs

DOI10.1017/S0963548315000334zbMath1422.05075MaRDI QIDQ5366923

Megha Khosla, Nikolaos Fountoulakis, Konstantinos D. Panagiotou

Publication date: 10 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Matching recovery threshold for correlated random graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Entropy, large deviations, and statistical mechanics.
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• The asymptotic number of labeled graphs with given degree sequences
• Sharp load thresholds for cuckoo hashing
• Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables
• Tight Thresholds for Cuckoo Hashing via XORSAT
• Orientability of Random Hypergraphs and the Power of Multiple Choices
• Cores in random hypergraphs and Boolean formulas

This page was built for publication: The Multiple-Orientability Thresholds for Random Hypergraphs