Adam Zsolt Wagner

Research Interests: Graph Theory, Combinatorics
Advisor: Jozsef Balogh

Teaching:

• Spring 2015: Math 220
• Review sheet: blank copy, solutions
• Fall 2016: Math 220
• Mock exam 2: blank copy, solutions

Publications:

• J. Balogh, T. Meszaros and A.Z. Wagner. Two results on the hypercube, submitted.
• J. Balogh, A. Treglown and A.Z. Wagner. Tilings in randomly perturbed dense graphs, submitted.
• J. Balogh, S. Petrickova and A.Z. Wagner, Families in posets minimizing the number of comparable pairs, submitted.
• C. Palmer, M. Tait, C. Timmons and A.Z. Wagner. Turan numbers for Berge-hypergraphs and related extremal problems, submitted.
• J. Balogh, S. Eberhard, B. Narayanan, A. Treglown and A.Z. Wagner. An improved lower bound for Folkman's Theorem, Bul. of the London Math. Soc., Vol. 49/4, 2017, 745-747.
• J. Balogh and A.Z. Wagner. Kleitman's conjecture about families of given size minimizing the number of k-chains, submitted.
• A.Z. Wagner. Large subgraphs in rainbow-triangle free colorings, Journal of Graph Theory, Volume 86, Issue 2, October 2017 Pages 141-148.
• J. Balogh and A.Z. Wagner. On the number of union-free families, Israel Journal of Mathematics 219.1 (2017): 431-448.
• J. Balogh, A. Treglown and A.Z. Wagner. Applications of Graph Containers in the Boolean Lattice, Random Structures & Algorithms 49.4 (2016): 845-872.
• J. Balogh and A.Z. Wagner. Further applications of the Container Method, Recent Trends in Combinatorics. Springer International Publishing, 2016. 191-213.
• Z.A.Wagner. Cops and Robbers on diameter two graphs, Discrete Mathematics 338.3 (2015): 107-109.
• Z.A.Wagner. Pursuit on Graphs, Master's thesis, Cambridge (Note: there is a mistake in section 5, the proof given is wrong, but fixable using this paper)