2 citations · 2 across the 3 of their papers we have counts for
8 papers · 2 filters
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…
Bounded Degree Spanners of the Hypercube
Rajko Nenadov, Mehtaab Sawhney, Benny Sudakov +1
In this short note we study two questions about the existence of subgraphs of the hypercube with certain properties. The first question, due to Erdős--Hamburger--Pippert--Wea…
The performance guarantee of randomized perfect voting trees
Jason Long, Adam Zsolt Wagner
In this note we study randomized voting trees, previously introduced by Fisher, Procaccia and Samorodnitsky. They speculate that a non-trivial performance guarantee may be achievab…
Completion and deficiency problems
Rajko Nenadov, Benny Sudakov, Adam Zsolt Wagner
Given a partial Steiner triple system (STS) of order , what is the order of the smallest complete STS it can be embedded into? The study of this question goes back more than 40…
Refuting conjectures in extremal combinatorics via linear programming
Adam Zsolt Wagner
We apply simple linear programming methods and an LP solver to refute a number of open conjectures in extremal combinatorics.