Elad Aigner-Horev

activity

20102026

most citedInfinite matroid union

17 citations · 47 across the 21 of their papers we have counts for

collaborators

Showing 2017Show all

2 papers · 1 filter

math.CO2017

Tight Hamilton cycles in cherry quasirandom $3$ -uniform hypergraphs

Elad Aigner Horev, Gil Levy

We employ the absorbing-path method in order to prove two results regarding the emergence of tight Hamilton cycles in the so called {\em two-path} or {\em cherry}-quasirandom $3$ -g…

math.CO2017★ 12 cited

Quasirandomness in hypergraphs

E. Aigner-Horev, D. Conlon, H. Hàn +2

An $n$ -vertex graph $G$ of edge density $p$ is considered to be quasirandom if it shares several important properties with the random graph $G (n, p)$ . A well-known theorem of Chung,…

Tight Hamilton cycles in cherry quasirandom 3-uniform hypergraphs

Quasirandomness in hypergraphs

Tight Hamilton cycles in cherry quasirandom $3$ -uniform hypergraphs