Shagnik Das

most citedIntersecting families of discrete structures are typically trivial

5 citations · 5 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2014

Comparable pairs in families of sets

Noga Alon, Shagnik Das, Roman Glebov +1

Given a family $F$ of subsets of $[n]$ , we say two sets $A, B \in F$ are comparable if $A \subset B$ or $B \subset A$ . Sperner's celebrated theorem gives the si…

math.CO2014★ 5 cited

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 $F \subset S_{n}$ is \emph{ $t$ -intersecting} if any two permutations in…

math.CO2012

A problem of Erdős on the minimum number of $k$ -cliques

Shagnik Das, Hao Huang, Jie Ma +2

Fifty years ago Erdős asked to determine the minimum number of $k$ -cliques in a graph on $n$ vertices with independence number less than l. He conjectured that this minimum is achi…

Comparable pairs in families of sets

Intersecting families of discrete structures are typically trivial

A problem of Erdős on the minimum number of k-cliques

A problem of Erdős on the minimum number of $k$ -cliques