The threshold probability for a spanning triangulation of a k-gon in G(n,p) is found up to a constant factor for 3 ≤ k ≤ n.
Spiro,A Smoother Notion of Spread Hypergraphs, Combinatorics, Probability and Computing, 32:5 (2023), 809-818
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Spanning triangulations in random graphs
The threshold probability for a spanning triangulation of a k-gon in G(n,p) is found up to a constant factor for 3 ≤ k ≤ n.