Hypergraph Thresholds is a theoretical construct in combinatorial mathematics that characterizes the critical probability or density at which a random hypergraph transitions from almost surely lacking a particular property to almost surely possessing it.
54
Publications
1.9K
Citations
73
Authors
68
Institutions
Publications per year
2017–2026
13
Parents
Publications
54
EXTREMAL RESULTS FOR RANDOM DISCRETE STRUCTURES
2009 · 147 citations
Cores in random hypergraphs and Boolean formulas
Michael Molloy · Random Structures and Algorithms · 2005 · 106 citations · Full text
Anders Johansson, Jeff Kahn, Van Vu · Random Structures and Algorithms · 2008 · 95 citations
1–5 of 54
Authors
73
- YZ
6
h-index
- JH
5
h-index
- AT
4
h-index
- PF
2
h-index
- AF
2
h-index
1–5 of 73
Institutions
68
Georgia State University
Atlanta, United States
6 h-index
9 publications
343 citations
University of Waterloo
Waterloo, Canada
3 h-index
4 publications
128 citations
Queen Mary University of London
London, United Kingdom
3 h-index
3 publications
107 citations
U.S. National Science Foundation
Alexandria, United States
2 h-index
2 publications
111 citations
Hebrew University of Jerusalem
Jerusalem, Israel
2 h-index
2 publications
104 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
2 h-index
4 publications
242 citations
ETH Zurich
Zurich, Switzerland
2 h-index
3 publications
60 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
3 publications
126 citations
1–8 of 68
Venues
- Random Structures and Algorithms
8 publications · 398 citations
8
h-index
- The Electronic Journal of Combinatorics
4 publications · 111 citations
4
h-index
- Combinatorics Probability Computing
3 publications · 60 citations
3
h-index
- SIAM Journal on Discrete Mathematics
3 publications · 60 citations
3
h-index
- Discrete Mathematics
3 publications · 104 citations
3
h-index
1–5