Orientability Thresholds for Random Hypergraphs
From MaRDI portal
Publication:5364256
DOI10.1017/S096354831400073XzbMath1371.05266MaRDI QIDQ5364256
Publication date: 4 October 2017
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Encores on cores
- Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
- Exploiting storage redundancy to speed up randomized shared memory simulations
- Fast concurrent access to parallel disks
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Asymptotic enumeration of sparse graphs with a minimum degree constraint
- Differential equations for random processes and random graphs
- Efficient PRAM simulation on a distributed memory machine
- Sudden emergence of a giant \(k\)-core in a random graph
- On the degrees of the vertices of a directed graph
- Load balancing and orientability thresholds for random hypergraphs
- Sharp load thresholds for cuckoo hashing
- Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables
- Balanced allocations
- Almost all graphs with 1.44n edges are 3-colorable
- Tight Thresholds for Cuckoo Hashing via XORSAT
- Balanced Allocations
- Probability Inequalities for Sums of Bounded Random Variables
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
