The Minrank of Random Graphs over Arbitrary Fields. - Noga Alon; Igor Balla; Lior Gishboliner; Adva Mond; Frank Mousset (CoRR, 2018)

On the odd cycle game and connected rules. - Jan Corsten; Adva Mond; Alexey Pokrovskiy; Christoph Spiegel 002; Tibor Szabó (Eur. J. Comb., 2020)

The complexity of decomposing a graph into a matching and a bounded linear forest. - Agnijo Banerjee; João Pedro Marciano; Adva Mond; Jan Petr; Julien Portier (CoRR, 2023)

( boldsymbol{H} )-Games Played on Vertex Sets of Random Graphs. - Gal Kronenberg; Adva Mond; Alon Naor (SIAM J. Discret. Math., 2023)

Counting Hamilton Cycles in Dirac Hypergraphs. - Asaf Ferber; Liam Hardiman; Adva Mond (Comb., 2023)

The asymptotic of off-diagonal online Ramsey numbers for paths. - Adva Mond; Julien Portier (Eur. J. Comb., 2024)

Minimum Degree Edge-Disjoint Hamilton Cycles in Random Directed Graphs. - Asaf Ferber; Adva Mond (STOC, 2025)