Paperlane

no. 12 · Tuesday 10 November 2026

Spanning triangulations in random graphs

S. Vakhrushev and M. Zhukovskii

math.CO · v2 · 20 pp

Abstract

In 1991 Bollobás and Frieze found the threshold for the emergence of a spanning triangulation of a triangle in the binomial random graph, up to a logarithmic factor. In this paper, we find the threshold probability for the emergence of a spanning triangulation of a $k$-gon for any $3\leq k\leq n$, up to a constant factor.

comments
20 pages, 6 figures
fields
Combinatorics, Probability
pdf ↗ page arXiv:2605.20361 ↗