Spanning triangulations in random graphs
Combinatorics
2026-05-21 v1 Probability
Abstract
In 1991 Bollob\'{a}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 -gon for any , up to a constant factor.
Cite
@article{arxiv.2605.20361,
title = {Spanning triangulations in random graphs},
author = {S. Vakhrushev and M. Zhukovskii},
journal= {arXiv preprint arXiv:2605.20361},
year = {2026}
}
Comments
20 pages, 6 figures