Get started
Author

Adam Zsolt Wagner

Observed names: ADAM ZSOLT WAGNER, Wagner, Adam Zsolt, Wagner, Zsolt Adam, Zsolt Adam Wagner
Observed institutions: Worcester Polytechnic Institute, University of Illinois Urbana-Champaign, Tel Aviv University, University of Cambridge, University of Illinois System, ETH Zurich, Google DeepMind (United Kingdom), Google (United Kingdom)
ORCID: 0000-0002-6423-3730
Observed ORCID: 0000-0002-6423-3730
OpenAlex ID: A5102935868
Tilings in randomly perturbed dense graphs
2019 · Balogh, Jozsef, Treglown, Andrew; id_orcid 0000-0002-4293-5678, et al. · University of Birmingham Research Portal (University of Birmingham) · 48
Turán numbers for Berge-hypergraphs and related extremal problems
2019 · Cory Palmer, Michael Tait, et al. · Discrete Mathematics · 23
PDF
Nearly-linear monotone paths in edge-ordered graphs
2020 · Matija Bucić, Matthew Kwan, et al. · Israel Journal of Mathematics · 18
PDF
Constructions in combinatorics via neural networks
2021 · Wagner, Adam Zsolt · arXiv (Cornell University) · 16
PDF
Tur\'an numbers for Berge-hypergraphs and related extremal problems
2017 · Cory Palmer, Michael Tait, et al. · arXiv (Cornell University) · 16
PDF
AlphaEvolve: A coding agent for scientific and algorithmic discovery
2025 · Novikov, Alexander, Vũ, Ngân, et al. · arXiv (Cornell University) · 15
PDF
Applications of graph containers in the Boolean lattice
2016 · Treglown, Andrew; id_orcid 0000-0002-4293-5678, Balogh, Jozsef, et al. · University of Birmingham Research Portal (University of Birmingham) · 15
Completion and deficiency problems
2020 · Rajko Nenadov, Benny Sudakov, et al. · Journal of Combinatorial Theory Series B · 12
Kleitman's conjecture about families of given size minimizing the number of k-chains
2018 · József Balogh, Adam Zsolt Wagner · Advances in Mathematics · 9
Refuting conjectures in extremal combinatorics via linear programming
2019 · Adam Zsolt Wagner · Journal of Combinatorial Theory Series A · 8
PDF
Further applications of the Container Method
2016 · József Balogh, Adam Zsolt Wagner · ˜The œIMA volumes in mathematics and its applications · 8
Partition problems in high dimensional boxes
2019 · Matija Bucic, Bernard Lidický, et al. · Journal of Combinatorial Theory Series A · 7
Cops and Robbers on diameter two graphs
2014 · Zsolt Adam Wagner · Discrete Mathematics · 7
PDF
Intersecting families of sets are typically trivial
2023 · József Balogh, Ramon I. Garcia, et al. · Journal of Combinatorial Theory Series B · 6
Two results about the hypercube
2018 · József Balogh, Tamás Mészáros, et al. · Discrete Applied Mathematics · 6
Large Subgraphs in Rainbow‐Triangle Free Colorings
2017 · Adam Zsolt Wagner · Journal of Graph Theory · 6
PDF
Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search
2024 · Abbas Mehrabian, Ankit Anand, et al. · 5
PDF
On the number of union-free families
2017 · József Balogh, Adam Zsolt Wagner · Israel Journal of Mathematics · 5
PDF
Uniform chain decompositions and applications
2021 · Benny Sudakov, István Tomon, et al. · Random Structures and Algorithms · 4
PDF
Advancing mathematics research with AI-driven formal proof search
2026 · George Tsoukalas, Anton Kovsharov, et al. · Science · 3
PDF
Mathematical exploration and discovery at scale
2025 · Georgiev, Bogdan, Gómez-Serrano, Javier, et al. · arXiv (Cornell University) · 3
PDF
The Ramsey Number of Fano Plane Versus Tight Path
2020 · József Balogh, Felix Christian Clemen, et al. · The Electronic Journal of Combinatorics · 3
PDF
Monochromatic Hilbert Cubes and Arithmetic Progressions
2019 · József Balogh, Mikhail Lavrov, et al. · The Electronic Journal of Combinatorics · 3
PDF
Tilings in Randomly Perturbed Dense Graphs
2018 · JÓZSEF BALOGH, ANDREW TREGLOWN, et al. · Combinatorics Probability Computing · 3
PDF
An improved lower bound for Folkman's theorem
2017 · József Balogh, Sean Eberhard, et al. · Bulletin of the London Mathematical Society · 3
PDF
Works count: 49
Citation count: 261
H-index: 9
I10-index: 8
Year
Topic
Type