5 citations · 5 across the 5 of their papers we have counts for
5 papers
Strong blocking sets and minimal codes from expander graphs
Noga Alon, Anurag Bishnoi, Shagnik Das +1
A strong blocking set in a finite projective space is a set of points that intersects each hyperplane in a spanning set. We provide a new graph theoretic construction of such sets:…
Covering grids with multiplicity
Anurag Bishnoi, Simona Boyadzhiyska, Shagnik Das +1
Given a finite grid in , how many lines are needed to cover all but one point at least times? Problems of this nature have been studied for decades, with a genera…
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…
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…
A problem of Erdős on the minimum number of -cliques
Shagnik Das, Hao Huang, Jie Ma +2
Fifty years ago Erdős asked to determine the minimum number of -cliques in a graph on vertices with independence number less than l. He conjectured that this minimum is achi…