Ilay Hoshen

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

Ilay Hoshen and Wojciech Samotij

Submitted

• Random Turán Theorem for the Fano Plane

Ilay Hoshen

Submitted

• A local central limit theorem for clique counts in sparse random graphs

Asaf Cohen Antonir, Ilay Hoshen, Maksim Zhukovskii

Submitted

• Tree tilings in random regular graphs

Sahar Diskin, Ilay Hoshen, Maksim Zhukovskii

ICALP

• Stability of large cuts in random graphs

Ilay Hoshen, Wojciech Samotij, Maksim Zhukovskii

Transactions of the American Mathematical Society (accepted)

• Saturation in random hypergraphs

Sahar Diskin, Ilay Hoshen, D\'{a}niel Kor\'{a}ndi, Benny Sudakov, Maksim Zhukovskii

Combinatorics, Probability and Computing 35(1), 40-58 

• Simonovits's theorem in random graphs

Ilay Hoshen, Wojciech Samotij

Submitted

• A jump of the saturation number in random graphs?

Sahar Diskin, Ilay Hoshen, Maksim Zhukovskii

Random Structures & Algorithms 66(4), e70009

• On vertex Ramsey graphs with forbidden subgraphs

Sahar Diskin, Ilay Hoshen, Michael Krivelevich

Discrete Mathematics 347(3)

Introduction to probability: Fall 2022, Fall 2023, Fall 2024, Fall 2025, Fall 2026

Introduction to combinatorics: Spring 2025

Introduction to probability and statistics: Spring 2023, Spring 2024, Spring 2026

Discrete mathematics: Fall 2023