On the threshold for triangulations inside convex polygons

Metadata

Item Type:	Article
Authors/Creators:	Kolesnik, B. https://orcid.org/0000-0003-2604-6093 Zakharov, G. Zhukovskii, M. https://orcid.org/0000-0001-8763-9533
Copyright, Publisher and Additional Information:	© 2026 The Author(s). Random Structures & Algorithms published by Wiley Periodicals LLC. This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited. http://creativecommons.org/licenses/by/4.0/
Keywords:	bootstrap percolation; Catalan numbers; critical threshold; graph bootstrap percolation; long-range dependency; oriented percolation; polluted bootstrap percolation; weak saturation
Dates:	Submitted: 10 December 2025 Accepted: 12 August 2026 Published (online): 7 September 2026 Published: September 2026
Institution:	The University of Sheffield
Academic Units:	The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield)
Date Deposited:	14 Sep 2026 15:22
Last Modified:	14 Sep 2026 15:22
Status:	Published
Publisher:	Wiley
Refereed:	Yes
Identification Number:	10.1002/rsa.70093
Open Archives Initiative ID (OAI ID):	oai:eprints.whiterose.ac.uk:245490

CORE (COnnecting REpositories)