22 citations · 51 across the 21 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
math.CO2013
Most Probably Intersecting Hypergraphs
Shagnik Das, Benny Sudakov
The celebrated Erdős-Ko-Rado theorem shows that for the largest intersecting -uniform set family on has size . It is natural to ask how far fr…
math.CO2013
The minimum number of disjoint pairs in set systems and related problems
Shagnik Das, Wenying Gan, Benny Sudakov
Let F be a set system on [n] with all sets having k elements and every pair of sets intersecting. The celebrated theorem of Erdos-Ko-Rado from 1961 says that any such system has si…
math.CO2013★ 7 cited
Sperner's Theorem and a Problem of Erdos-Katona-Kleitman
Shagnik Das, Wenying Gan, Benny Sudakov
A central result in extremal set theory is the celebrated theorem of Sperner from 1928, which gives the size of the largest family of subsets of [n] not containing a 2-chain. Erdos…