The threshold for a (d, α)-degenerate bounded-degree k-uniform hypergraph to appear in the random k-uniform hypergraph is at most n^{-1/d}, removing the logarithmic factor from prior bounds.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On the thresholds of degenerate hypergraphs
The threshold for a (d, α)-degenerate bounded-degree k-uniform hypergraph to appear in the random k-uniform hypergraph is at most n^{-1/d}, removing the logarithmic factor from prior bounds.