22 citations · 51 across the 21 of their papers we have counts for
4 papers · 1 filter
Removal and Stability for Erdős-Ko-Rado
Shagnik Das, Tuan Tran
A -uniform family of subsets of is intersecting if it does not contain a disjoint pair of sets. The study of intersecting families is central to extremal set theory, datin…
Comparable pairs in families of sets
Noga Alon, Shagnik Das, Roman Glebov +1
Given a family of subsets of , we say two sets are comparable if or . Sperner's celebrated theorem gives the si…
Almost-Fisher families
Shagnik Das, Benny Sudakov, Pedro Vieira
A classic theorem in combinatorial design theory is Fisher's inequality, which states that a family of subsets of with all pairwise intersections of size can…
Intersecting families of discrete structures are typically trivial
József Balogh, Shagnik Das, Michelle Delcourt +2
The study of intersecting structures is central to extremal combinatorics. A family of permutations is \emph{-intersecting} if any two permutations in…