Proceedings of the AMS 2024+ The extremal number of Venn diagrams

[arXiv] JCTB 2024 Intersecting families of sets are typically trivial
Jozsef Balogh, Ramon I. Garcia, Lina Li and Adam Zsolt Wagner
[arXiv] Electronic Journal of Combinatorics 2023 Balanced edge-colorings avoiding rainbow cliques of size four
Felix Clemen and Adam Zsolt Wagner
[arXiv] NeurIPS Math-AI 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, Bernardino Romera Paredes, Petar Veličković, Laurent Orseau, Joonkyung Lee, Anurag Murty Naredla, Doina Precup and Adam Zsolt Wagner
[arXiv] JCTA 2022 Infinite Sperner's theorem
Benny Sudakov, Istvan Tomon and Adam Zsolt Wagner
[arXiv] Random Structures & Algorithms 2022 Uniform chain decompositions and applications
Benny Sudakov, Istvan Tomon and Adam Zsolt Wagner
[arXiv] arXiv 2021 Constructions in combinatorics via neural networks
Adam Zsolt Wagner
[arXiv]
Quanta article Electronic Journal of Combinatorics 2020 Bounded Degree Spanners of the Hypercube
Rajko Nenadov, Mehtaab Sawhney, Benny Sudakov and Adam Zsolt Wagner
[arXiv] Israel Journal of Mathematics 2020 Nearly-linear monotone paths in edge-ordered graphs
Matija Bucic, Matthew Kwan, Alexey Pokrovskiy, Benny Sudakov, Tuan Tran and Adam Zsolt Wagner
[arXiv] JCTA 2020 Refuting conjectures in extremal combinatorics via linear programming
Adam Zsolt Wagner
[arXiv] JCTB 2020 Completion and deficiency problems
Rajko Nenadov, Benny Sudakov and Adam Zsolt Wagner
[arXiv] Electronic Journal of Combinatorics 2020 The Ramsey Number of Fano Plane Versus Tight Path
Jozsef Balogh, Felix Klemen, Jozef Skokan and Adam Zsolt Wagner
[arXiv] Journal of Graph Theory 2020 Families in posets minimizing the number of comparable pairs
Jozsef Balogh, Sarka Petrickova and Adam Zsolt Wagner
[arXiv] arXiv 2019 The performance guarantee of randomized perfect voting trees
Jason Long and Adam Zsolt Wagner
[arXiv] European Journal of Combinatorics 2019 The largest projective cube-free subsets of Z_{2^n}
Jason Long and Adam Zsolt Wagner
[arXiv] JCTA 2019 Partition problems in high dimensional boxes
Matija Bucic, Bernard Lidicky, Jason Long and Adam Zsolt Wagner
[arXiv] Discrete Mathematics 2019 Turan numbers for Berge-hypergraphs and related extremal problems
Cory Palmer, Michael Tait, Craig Timmons and Adam Zsolt Wagner
[arXiv] arXiv 2019 A note on some conjectures about combinatorial models for RNA secondary structures
Adam Zsolt Wagner
[arXiv] Electronic Journal of Combinatorics 2019 Monochromatic Hilbert cubes and arithmetic progressions
Jozsef Balogh, Mikhail Lavrov, George Shakan and Adam Zsolt Wagner
[arXiv] Combinatorics, Probability and Computing 2018 Tilings in randomly perturbed dense graphs
Jozsef Balogh, Andrew Treglown and Adam Zsolt Wagner
[arXiv] Advances in Mathematics 2018 Kleitman's conjecture about families of given size minimizing the number of k-chains
Jozsef Balogh and Adam Zsolt Wagner
[arXiv] Discrete Applied Mathematics 2018 Two results about the hypercube
Jozsef Balogh, Tamas Meszaros and Adam Zsolt Wagner
[arXiv] Bul. of the London Math. Soc. 2017 An improved lower bound for Folkman's Theorem
Jozsef Balogh, Sean Eberhard, Bhargav Narayanan, Andrew Treglown and Adam Zsolt Wagner
[arXiv] Journal of Graph Theory 2017 Large subgraphs in rainbow-triangle free colorings
Adam Zsolt Wagner
[arXiv] Israel Journal of Mathematics 2017 On the number of union-free families
Jozsef Balogh and Adam Zsolt Wagner
[arXiv] Random Structures & Algorithms 2016 Applications of Graph Containers in the Boolean Lattice
Jozsef Balogh, Andrew Treglown and Adam Zsolt Wagner
[arXiv] Recent Trends in Combinatorics 2016 Further applications of the Container Method
Jozsef Balogh and Adam Zsolt Wagner
[arXiv] Discrete Mathematics 2015 Cops and Robbers on diameter two graphs
Adam Zsolt Wagner
[arXiv] - Pursuit on Graphs (Master's thesis)
Adam Zsolt Wagner
[pdf]