Answers are grounded in this paper and cite their sources.
Fix d>0,α,ε∈(0,1]. An n-vertex k-uniform hypergraph G is (d,α,ε)-degenerate if m₁(G)≤d+d/log₂ n and e(G[U])≤d(|U|-1)-α for every subset U⊆V(G) of size 2≤|U|≤ε n. These hypergraphs encompass several natural (hyper)graph classes, including d-degenerate hypergraphs for integers d≥2, planar graphs, and powers of cycles. In this paper, we consider the appearance threshold of a (d,α,ε)-degenerate hypergraph with bounded maximum degree in the Erdős–Rényi model. We show that G⁽ᵏ⁾(n,pₙ) contains Gₙ with high probability whenever pₙ=ω(n-1/d), improving previous results of Riordan and Kelly–Müyesser–Pokrovskiy.
No takes yet. Share an insight, caveat, or question.
Chen et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: