Ilay Hoshen

collaborators

4 papers

math.CO2026

A Local Central Limit Theorem for Clique Counts in Sparse Random Graphs

Asaf Cohen Antonir, Ilay Hoshen, Maksim Zhukovskii

Let $X_{H}$ denote the number of copies of a fixed graph $H$ in $G_{n, p}$ . Gilmer and Kopparty conjectured that $X_{H}$ satisfies a local central limit theorem (LCLT) provided that $H…

math.CO2026

Optimal lower bounds for epsilon-nets for lines in the plane

Ilay Hoshen, Wojciech Samotij

We prove that, for arbitrarily small positive $ε$ , there is a finite planar point set $P$ such that every $ε$ -net for the range space induced on $P$ by straight…

math.CO2026

Random Turán Theorem for the Fano Plane

Ilay Hoshen

Let $F$ denote the Fano plane, the $3$ -uniform hypergraph with $7$ vertices and $7$ edges. Frankl and Füredi, and independently Keevash and Sudakov, proved that the largest $F$ -fre…

math.CO2024

Tree tilings in random regular graphs

Sahar Diskin, Ilay Hoshen, Maksim Zhukovskii

We show that for every $ε > 0$ there exists a sufficiently large $d_{0} \in N$ such that for every $d \geq d_{0}$ , whp the random $d$ -regular graph $G (n, d)$ contains a $T$ -factor f…