The following is a list of all papers containing research which has been funded by this project.
On 2-factors of Hamiltonian graphs (preprint)
Alberto Espuny Díaz, António Girão, Bertille Granet and Gal Kronenberg
Submitted
On constructing small subgraphs in the budget-constrained random graph process (preprint)
Sylwia Antoniuk, Alberto Espuny Díaz, Kalina Petrova and Miloš Stojaković
Submitted
Graph factors and powers of Hamilton cycles in the budget-constrained random graph process (preprint)
Alberto Espuny Díaz, Frederik Garbe, Tássio Naia and Zak Smith
Random Structures & Algorithms (to appear)
Exponential odd-distance sets under the Manhattan metric (preprint) (doi)
Alberto Espuny Díaz, Emma Hogan, Freddie Illingworth, Lukas Michel, Julien Portier and Jun Yan
Electronic Journal of Combinatorics 32 (2025), P4.32
How many random edges make an almost-Dirac graph Hamiltonian? (preprint) (doi)
Alberto Espuny Díaz and Richarlotte V. Razafindravola
Electronic Journal of Combinatorics 32 (2025), P4.47
Dirac's theorem for graphs of bounded bandwidth (preprint)
Alberto Espuny Díaz, Pranshu Gupta, Domenico Mergoni Cecchelli, Olaf Parczyk and Amedeo Sgueglia
Electronic Journal of Combinatorics 33 (2026), P1.21
On the local resilience of random geometric graphs with respect to connectivity and long cycles (preprint)
Alberto Espuny Díaz, Lyuben Lichev and Alexandra Wesolek
Submitted
Seymour's second neighbourhood conjecture: random graphs and reductions (preprint) (doi)
Alberto Espuny Díaz, António Girão, Bertille Granet and Gal Kronenberg
Random Structures & Algorithms 66 (2025), e21251