27 citations · 34 across the 2 of their papers we have counts for
3 papers
math.CO2013★ 27 cited
Maximizing the number of independent sets of a fixed size
Wenying Gan, Po-Shen Loh, Benny Sudakov
Let be the number of independent sets of size in a graph . Engbers and Galvin asked how large could be in graphs with minimum degree at least . They fur…
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…