Dynamic concentration of the triangle‐free process

The triangle‐free process begins with an empty graph on n vertices and iteratively adds edges chosen uniformly at random subject to the constraint that no triangle is formed. We determine the asymptotic number of edges in the maximal triangle‐free graph at which the triangle‐free process terminates....

Full description

Bibliographic Details

Published in:	Random structures & algorithms Vol. 58; no. 2; pp. 221 - 293
Main Authors:	Bohman, Tom, Keevash, Peter
Format:	Journal Article
Language:	English
Published:	New York John Wiley & Sons, Inc 01.03.2021 Wiley Subscription Services, Inc
Subjects:	Apexes dynamic concentration Graph theory Lower bounds Ramsey numbers triangle‐free Upper bounds
ISSN:	1042-9832, 1098-2418
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!