A proof of the rooted tree alternative conjecture. - Mykhaylo Tyomkyn (Discret. Math., 2009)

Completing partial packings of bipartite graphs. - Zoltán Füredi; Ago-Erik Riet; Mykhaylo Tyomkyn (J. Comb. Theory A, 2011)

An improved bound for the Manickam-Miklós-Singhi conjecture. - Mykhaylo Tyomkyn (Eur. J. Comb., 2012)

Walks and paths in trees. - Béla Bollobás; Mykhaylo Tyomkyn (J. Graph Theory, 2012)

A Turán-Type Problem on Distances in Graphs. - Mykhaylo Tyomkyn; Andrew J. Uzzell (Graphs Comb., 2013)

Strong Turán stability. - Mykhaylo Tyomkyn; Andrew J. Uzzell (Electron. Notes Discret. Math., 2015)

Universality of Graphs with Few Triangles and Anti-Triangles. - Dan Hefetz; Mykhaylo Tyomkyn (Comb. Probab. Comput., 2016)

Lagrangians of hypergraphs: The Frankl-Füredi conjecture holds almost everywhere. - Mykhaylo Tyomkyn (Electron. Notes Discret. Math., 2017)

On the inducibility of cycles. - Dan Hefetz; Mykhaylo Tyomkyn (J. Comb. Theory B, 2018)

Edge-statistics on large graphs. - Noga Alon; Dan Hefetz; Michael Krivelevich; Mykhaylo Tyomkyn (Comb. Probab. Comput., 2020)

Many disjoint triangles in co-triangle-free graphs. - Mykhaylo Tyomkyn (Comb. Probab. Comput., 2021)

Two Erdős-Hajnal-type theorems in hypergraphs. - Michal Amir; Asaf Shapira; Mykhaylo Tyomkyn (J. Comb. Theory B, 2021)

Repeated Patterns in Proper Colorings. - David Conlon; Mykhaylo Tyomkyn (SIAM J. Discret. Math., 2021)

Quasirandom Graphs and the Pantograph Equation. - Asaf Shapira; Mykhaylo Tyomkyn (Am. Math. Mon., 2021)

On the Small Quasi-kernel conjecture. - Péter L. Erdös; Ervin Györi; Tamás Róbert Mezei; Nika Salia; Mykhaylo Tyomkyn (CoRR, 2023)

Ramsey numbers of trails and circuits. - David Conlon; Mykhaylo Tyomkyn (J. Graph Theory, 2023)

Weak Saturation of Multipartite Hypergraphs. - Denys Bulavka; Martin Tancer; Mykhaylo Tyomkyn (Comb., 2023)

On the Small Quasi-kernel Conjecture - A Survey. - Péter L. Erdös; Ervin Györi; Tamás Róbert Mezei; Nika Salia; Mykhaylo Tyomkyn (Information Theory and Related Fields, 2025)