18 citations · 40 across the 27 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
math.CO2014
Strong Turán stability
Mykhaylo Tyomkyn, Andrew J. Uzzell
We study the behaviour of -free graphs of almost extremal size, that is, typically, . We show that such graphs must have a large amount of 'sy…
math.CO2014★ 1 cited
Universality of graphs with few triangles and anti-triangles
Dan Hefetz, Mykhaylo Tyomkyn
We study 3-random-like graphs, that is, sequences of graphs in which the densities of triangles and anti-triangles converge to 1/8. Since the random graph is…