Orientability of Random Hypergraphs and the Power of Multiple Choices

DOI10.1007/978-3-642-14165-2_30zbMath1288.05186OpenAlexW1843221757MaRDI QIDQ3587390

Nikolaos Fountoulakis, Konstantinos D. Panagiotou

Publication date: 7 September 2010

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14165-2_30

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (7)

Sharp load thresholds for cuckoo hashing ⋮ Load Thresholds for Cuckoo Hashing with Overlapping Blocks ⋮ Load Thresholds for Cuckoo Hashing with Overlapping Blocks ⋮ The Multiple-Orientability Thresholds for Random Hypergraphs ⋮ Thresholds for extreme orientability ⋮ Core forging and local limit theorems for the \(k\)-core of random graphs ⋮ A new approach to the orientation of random hypergraphs

This page was built for publication: Orientability of Random Hypergraphs and the Power of Multiple Choices