Mykhaylo Tyomkyn

activity

20082026

most citedLagrangians of hypergraphs: The Frankl-Füredi conjecture holds almost everywhere

18 citations · 40 across the 27 of their papers we have counts for

collaborators

Showing 2010Show all

4 papers · 1 filter

math.CO2010★ 2 cited

An improved bound for the Manickam-Miklós-Singhi conjecture

Mykhaylo Tyomkyn

We show that for $n > k (4 e lo g k)^{k}$ every set ${x_{1}, ..., x_{n}}$ of $n$ real numbers with $\sum_{i = 0}^{n} x_{i} \geq 0$ has at least $(k - 1 n - 1)$ $k$ -element subsets of a non-neg…

math.CO2010

A Turan-type problem on distances in graphs

Mykhaylo Tyomkyn, Andrew Uzzell

We suggest a new type of problem about distances in graphs and make several conjectures. As a first step towards proving them, we show that for sufficiently large values of n and k…

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…