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

2 papers · 1 filter

math.CO2023★ 1 cited

Simonovits's theorem in random graphs

Ilay Hoshen, Wojciech Samotij

Let $H$ be a graph with $χ (H) = r + 1$ . Simonovits's theorem states that, if $H$ is edge-critical, the unique largest $H$ -free subgraph of $K_{n}$ is its largest $r$ -partite subgraph,…

math.CO2023

A Jump of the Saturation Number in Random Graphs?

Sahar Diskin, Ilay Hoshen, Maksim Zhukovskii

For graphs $G$ and $F$ , the saturation number $sat (G, F)$ is the minimum number of edges in an inclusion-maximal $F$ -free subgraph of $G$ . In 2017, Korándi and Sudakov init…