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....

Celý popis

Podrobná bibliografia

Vydané v:	Random structures & algorithms Ročník 58; číslo 2; s. 221 - 293
Hlavní autori:	Bohman, Tom, Keevash, Peter
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York John Wiley & Sons, Inc 01.03.2021 Wiley Subscription Services, Inc
Predmet:	Apexes dynamic concentration Graph theory Lower bounds Ramsey numbers triangle‐free Upper bounds
ISSN:	1042-9832, 1098-2418
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!