Ilay Hoshen

works on

extremal combinatorics 1 fano plane 1 random hypergraphs 1 sharp threshold 1 turán theorem 1

From the 1 of 4 linked papers with an AI index.

collaborators

4 papers

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

The paper determines the exact threshold probability at which the largest Fano‑plane‑free subhypergraph of a random 3‑uniform hypergraph becomes bipartite, establishing a sharp pha…

math.CO2025

Saturation in Random Hypergraphs

Sahar Diskin, Ilay Hoshen, DÃ¡niel KorÃ¡ndi +2

Let $K_{n}^{r}$ be the complete $r$ -uniform hypergraph on $n$ vertices, that is, the hypergraph whose vertex set is $[n] := {1, 2, ..., n}$ and whose edge set is $(r [ n ])$ . We form…

math.CO2025

Tree tilings in random regular graphs

Sahar Diskin, Ilay Hoshen, Maksim Zhukovskii

We show that for every $I^µ > 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…