We stand with Ukraine  

Mykhaylo Tyomkyn

Orcid: 0000-0002-3491-4068

According to our database1, Mykhaylo Tyomkyn authored at least 18 papers between 2009 and 2025.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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

2023
Weak Saturation of Multipartite Hypergraphs.
[BibTeX]
[DOI]
Denys Bulavka
,
Martin Tancer
,
Mykhaylo Tyomkyn
Comb., December, 2023

Ramsey numbers of trails and circuits.
[BibTeX]
[DOI]
David Conlon
,
Mykhaylo Tyomkyn
J. Graph Theory, 2023

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

2021
Quasirandom Graphs and the Pantograph Equation.
[BibTeX]
[DOI]
Asaf Shapira
,
Mykhaylo Tyomkyn
Am. Math. Mon., 2021

Repeated Patterns in Proper Colorings.
[BibTeX]
[DOI]
David Conlon
,
Mykhaylo Tyomkyn
SIAM J. Discret. Math., 2021

Two Erdős-Hajnal-type theorems in hypergraphs.
[BibTeX]
[DOI]
Michal Amir
,
Asaf Shapira
,
Mykhaylo Tyomkyn
J. Comb. Theory B, 2021

Many disjoint triangles in co-triangle-free graphs.
[BibTeX]
[DOI]
Mykhaylo Tyomkyn
Comb. Probab. Comput., 2021

2020
Edge-statistics on large graphs.
[BibTeX]
[DOI]
Noga Alon
,
Dan Hefetz
,
Michael Krivelevich
,
Mykhaylo Tyomkyn
Comb. Probab. Comput., 2020

2018
On the inducibility of cycles.
[BibTeX]
[DOI]
Dan Hefetz
,
Mykhaylo Tyomkyn
J. Comb. Theory B, 2018

2017
Lagrangians of hypergraphs: The Frankl-Füredi conjecture holds almost everywhere.
[BibTeX]
[DOI]
Mykhaylo Tyomkyn
Electron. Notes Discret. Math., 2017

2016
Universality of Graphs with Few Triangles and Anti-Triangles.
[BibTeX]
[DOI]
Dan Hefetz
,
Mykhaylo Tyomkyn
Comb. Probab. Comput., 2016

2015
Strong Turán stability.
[BibTeX]
[DOI]
Mykhaylo Tyomkyn
,
Andrew J. Uzzell
Electron. Notes Discret. Math., 2015

2013
A Turán-Type Problem on Distances in Graphs.
[BibTeX]
[DOI]
Mykhaylo Tyomkyn
,
Andrew J. Uzzell
Graphs Comb., 2013

2012
Walks and paths in trees.
[BibTeX]
[DOI]
Béla Bollobás
,
Mykhaylo Tyomkyn
J. Graph Theory, 2012

An improved bound for the Manickam-Miklós-Singhi conjecture.
[BibTeX]
[DOI]
Mykhaylo Tyomkyn
Eur. J. Comb., 2012

2011
Completing partial packings of bipartite graphs.
[BibTeX]
[DOI]
Zoltán Füredi
,
Ago-Erik Riet
,
Mykhaylo Tyomkyn
J. Comb. Theory A, 2011

2009
A proof of the rooted tree alternative conjecture.
[BibTeX]
[DOI]
Mykhaylo Tyomkyn
Discret. Math., 2009


  Loading...