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 2019Show all

2 papers · 1 filter

math.CO2019★ 2 cited

A Ramsey variant of the Brown-Erdős-Sós conjecture

Asaf Shapira, Mykhaylo Tyomkyn

An $r$ -uniform hypergraph ( $r$ -graph for short) is called linear if every pair of vertices belong to at most one edge. A linear $r$ -graph is complete if every pair of vertices are…

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…