104 citations · 132 across the 9 of their papers we have counts for
24 papers
A note on balanced edge-colorings avoiding rainbow cliques of size four
Felix Christian Clemen, Adam Zsolt Wagner
A balanced edge-coloring of the complete graph is an edge-coloring such that every vertex is incident to each color the same number of times. In this short note, we present a const…
Constructions in combinatorics via neural networks
Adam Zsolt Wagner
We demonstrate how by using a reinforcement learning algorithm, the deep cross-entropy method, one can find explicit constructions and counterexamples to several open conjectures i…
Intersecting families of sets are typically trivial
József Balogh, Ramon I. Garcia, Lina Li +1
A family of subsets of is intersecting if every pair of its sets intersects. Determining the structure of large intersecting families is a central problem in extremal combina…
Infinite Sperner's theorem
Benny Sudakov, István Tomon, Adam Zsolt Wagner
One of the most classical results in extremal set theory is Sperner's theorem, which says that the largest antichain in the Boolean lattice has size $Θ\big(\frac{2^n}{\sq…
Uniform chain decompositions and applications
Benny Sudakov, Istvan Tomon, Adam Zsolt Wagner
The Boolean lattice is the family of all subsets of ordered by inclusion, and a chain is a family of pairwise comparable elements of . Let $s…
The extremal number of Venn diagrams
Peter Keevash, Imre Leader, Jason Long +1
We show that there exists an absolute constant such that any family of size at least has dual VC-dimension at least 3. Equivalently, eve…