An improved bound on the cop number of graphs of small diameter. - Zsolt Adam Wagner (CoRR, 2013)

Cops and Robbers on diameter two graphs. - Zsolt Adam Wagner (Discret. Math., 2015)

Applications of graph containers in the Boolean lattice. - József Balogh; Andrew Treglown; Zsolt Adam Wagner (Random Struct. Algorithms, 2016)

Large Subgraphs in Rainbow-Triangle Free Colorings. - Zsolt Adam Wagner (J. Graph Theory, 2017)

Two results about the hypercube. - József Balogh; Tamás Mészáros 001; Zsolt Adam Wagner (Discret. Appl. Math., 2018)

Monochromatic Hilbert Cubes and Arithmetic Progressions. - József Balogh; Mikhail Lavrov; George Shakan; Adam Zsolt Wagner (Electron. J. Comb., 2019)

Tilings in Randomly Perturbed Dense Graphs. - József Balogh; Andrew Treglown; Zsolt Adam Wagner (Comb. Probab. Comput., 2019)

Turán numbers for Berge-hypergraphs and related extremal problems. - Cory Palmer; Michael Tait; Craig Timmons; Zsolt Adam Wagner (Discret. Math., 2019)

The largest projective cube-free subsets of Z2n. - Jason Long; Adam Zsolt Wagner (Eur. J. Comb., 2019)

Partition problems in high dimensional boxes. - Matija Bucic; Bernard Lidický; Jason Long; Adam Zsolt Wagner (J. Comb. Theory A, 2019)

The Ramsey Number of Fano Plane Versus Tight Path. - József Balogh; Felix Christian Clemen; Jozef Skokan; Adam Zsolt Wagner (Electron. J. Comb., 2020)

Bounded Degree Spanners of the Hypercube. - Rajko Nenadov; Mehtab Sawhney; Benny Sudakov; Adam Zsolt Wagner (Electron. J. Comb., 2020)

Refuting conjectures in extremal combinatorics via linear programming. - Adam Zsolt Wagner (J. Comb. Theory A, 2020)

Completion and deficiency problems. - Rajko Nenadov; Benny Sudakov; Adam Zsolt Wagner (J. Comb. Theory B, 2020)

Families in posets minimizing the number of comparable pairs. - József Balogh; Sárka Petrícková; Adam Zsolt Wagner (J. Graph Theory, 2020)

Constructions in combinatorics via neural networks. - Adam Zsolt Wagner (CoRR, 2021)

Infinite Sperner's theorem. - Benny Sudakov; István Tomon; Adam Zsolt Wagner (J. Comb. Theory A, 2022)

Uniform chain decompositions and applications. - Benny Sudakov; István Tomon; Adam Zsolt Wagner (Random Struct. Algorithms, 2022)

Balanced Edge-Colorings Avoiding Rainbow Cliques of Size Four. - Felix Christian Clemen; Adam Zsolt Wagner (Electron. J. Comb., 2023)

Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search. - Abbas Mehrabian; Ankit Anand; Hyunjik Kim; Nicolas Sonnerat; Matej Balog; Gheorghe Comanici; Tudor Berariu; Andrew Lee; Anian Ruoss; Anna Bulanova; Daniel Toyama; Sam Blackwell; et al. (IJCAI, 2024)

PatternBoost: Constructions in Mathematics with a Little Help from AI. - François Charton; Jordan S. Ellenberg; Adam Zsolt Wagner; Geordie Williamson (CoRR, 2024)

A Note on Small Percolating Sets on Hypercubes via Generative AI. - Gergely Bérczi; Adam Zsolt Wagner (CoRR, 2024)

Intersecting families of sets are typically trivial. - József Balogh; Ramon Garcia; Lina Li; Adam Zsolt Wagner (J. Comb. Theory B, 2024)

Advancing Geometry with AI: Multi-agent Generation of Polytopes. - Grzegorz Swirszcz; Adam Zsolt Wagner; Geordie Williamson; Sam Blackwell; Bogdan Georgiev; Alex Davies; S. M. Ali Eslami; Sébastien Racanière; Theophane Weber; Pushmeet Kohli (CoRR, 2025)

Drums of high width. - Alex Davies; Prateek Gupta; Sébastien Racanière; Grzegorz Swirszcz; Adam Zsolt Wagner; Theophane Weber; Geordie Williamson (CoRR, 2025)

AlphaEvolve: A coding agent for scientific and algorithmic discovery. - Alexander Novikov 001; Ngân Vu; Marvin Eisenberger; Emilien Dupont; Po-Sen Huang; Adam Zsolt Wagner; Sergey Shirobokov; Borislav Kozlovskii; Francisco J. R. Ruiz; Abbas Mehrabian; M. Pawan Kumar; Abigail See; et al. (CoRR, 2025)