Publications (16)
Completion and deficiency problems
Rajko Nenadov, Benny Sudakov, Adam Zsolt Wagner
The paper proves that any sparse partial Steiner triple system with at most r ≤ ε n² triples can be embedded into a complete Steiner triple system of order n + O(√r), and introduce…
Monochromatic Hilbert cubes and arithmetic progressions
József Balogh, Mikhail Lavrov, George Shakan +1
The Ramsey Number of Fano Plane Versus Tight Path
József Balogh, Felix Christian Clemen, Jozef Skokan +1
Large subgraphs in rainbow-triangle free colorings
Adam Zsolt Wagner
The largest projective cube-free subsets of $\mathbb{Z}_{2^n}$
Jason Long, Adam Zsolt Wagner
On the number of union-free families
Jozsef Balogh, Adam Zsolt Wagner
Turán numbers for Berge-hypergraphs and related extremal problems
Cory Palmer, Michael Tait, Craig Timmons +1
Refuting conjectures in extremal combinatorics via linear programming
Adam Zsolt Wagner
An improved lower bound for Folkman's theorem
József Balogh, Sean Eberhard, Bhargav Narayanan +2
Further applications of the Container Method
Jozsef Balogh, Adam Zsolt Wagner
A note on some conjectures about combinatorial models for RNA secondary structures
Adam Zsolt Wagner
The performance guarantee of randomized perfect voting trees
Jason Long, Adam Zsolt Wagner
Tilings in randomly perturbed dense graphs
József Balogh, Andrew Treglown, Adam Zsolt Wagner
Two results about the hypercube
Jozsef Balogh, Tamas Meszaros, Adam Zsolt Wagner
Applications of graph containers in the Boolean lattice
Jozsef Balogh, Andrew Treglown, Adam Zsolt Wagner
Kleitman's conjecture about families of given size minimizing the number of $k$-chains
Jozsef Balogh, Adam Zsolt Wagner