Mykhaylo Tyomkyn

activity

20102023

collaborators

3 papers

math.CO2014

Strong Turán stability

Mykhaylo Tyomkyn, Andrew J. Uzzell

We study the behaviour of $K_{r + 1}$ -free graphs $G$ of almost extremal size, that is, typically, $e (G) = e x (n, K_{r + 1}) - O (n)$ . We show that such graphs must have a large amount of 'sy…

math.CO2010

Completing Partial Packings of Bipartite Graphs

Zoltán Füredi, Ago-Erik Riet, Mykhaylo Tyomkyn

Given a bipartite graph $H$ and an integer $n$ , let $f (n; H)$ be the smallest integer such that, any set of edge disjoint copies of $H$ on $n$ vertices, can be extended to an $H$ -de…

math.CO2010

Walks and Paths in Trees

Bela Bollobas, Mykhaylo Tyomkyn

Recently Csikvári \cite{csik} proved a conjecture of Nikiforov concerning the number of closed walks on trees. Our aim is to extend his theorem to all walks. In addition, we give a…