Ilay Hoshen

activity

20222026

most citedSimonovits's theorem in random graphs

1 citations · 1 across the 7 of their papers we have counts for

collaborators

Showing 2024Show all

3 papers · 1 filter

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…

math.CO2024

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.CO2024

Stability of large cuts in random graphs

Ilay Hoshen, Wojciech Samotij, Maksim Zhukovskii

We prove that the family of largest cuts in the binomial random graph exhibits the following stability property: If $1/ n ≪ p = 1 - Ω (1)$ , then, with high probability, there is a se…