Mykhaylo Tyomkyn

activity

20082021

most citedAn improved bound for the Manickam-Miklós-Singhi conjecture

2 citations · 3 across the 5 of their papers we have counts for

collaborators

9 papers

math.CO2021

Weakly saturated hypergraphs and a conjecture of Tuza

Asaf Shapira, Mykhaylo Tyomkyn

Given a fixed hypergraph $H$ , let $\mbox{wsat}(n,H)$ denote the smallest number of edges in an $n$ -vertex hypergraph $G$ , with the property that one can sequentially add the edges…

math.CO2021

Quasirandom Graphs and the Pantograph Equation

Asaf Shapira, Mykhaylo Tyomkyn

The pantograph differential equation and its solution, the deformed exponential function, are remarkable objects that appear in areas as diverse as combinatorics, number theory, st…

math.CO2020

Many disjoint triangles in co-triangle-free graphs

Mykhaylo Tyomkyn

We prove that any $n$ -vertex graph whose complement is triangle-free contains $n^{2} /12 - o (n^{2})$ edge-disjoint triangles. This is tight for the disjoint union of two cliques of order…

math.CO2019

Proof of the Brown-Erdős-Sós conjecture in groups

Rajko Nenadov, Benny Sudakov, Mykhaylo Tyomkyn

The conjecture of Brown, Erdős and Sós from 1973 states that, for any $k \geq 3$ , if a $3$ -uniform hypergraph $H$ with $n$ vertices does not contain a set of $k + 3$ vertices spanning…

math.CO2018

Two Erdős--Hajnal-type Theorems in Hypergraphs

Michal Amir, Asaf Shapira, Mykhaylo Tyomkyn

The Erdős--Hajnal Theorem asserts that non-universal graphs, that is, graphs that do not contain an induced copy of some fixed graph $H$ , have homogeneous sets of size significantl…

math.CO2018

Edge-statistics on large graphs

Noga Alon, Dan Hefetz, Michael Krivelevich +1

The inducibility of a graph $H$ measures the maximum number of induced copies of $H$ a large graph $G$ can have. Generalizing this notion, we study how many induced subgraphs of fi…