Spanning triangulations in random graphs
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≤ k≤ n, up to a constant factor.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.