345 citations · 400 across the 16 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.CO2019★ 4 cited
Approximate Steiner -systems without blocks on points
Alexander Sidorenko
For a family of -graphs, let denote the maximum number of edges in an -free -graph on vertices. Let ${\mathcal…
math.CO2019★ 1 cited
Inequalities for doubly nonnegative functions
Alexander Sidorenko
Let be a bounded symmetric measurable nonnegative function on , and . For a graph with vertices $\{v_1,v_…