Shagnik Das

activity

20122026

most citedRamsey properties of randomly perturbed graphs: cliques and cycles

22 citations · 51 across the 21 of their papers we have counts for

collaborators

Showing 2012Show all

2 papers · 1 filter

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…

math.CO2012

Rainbow Turán Problem for Even Cycles

Shagnik Das, Choongbum Lee, Benny Sudakov

An edge-colored graph is rainbow if all its edges are colored with distinct colors. For a fixed graph $H$ , the rainbow Turán number $ex^{*} (n, H)$ is defined as the maxi…

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

Rainbow Turán Problem for Even Cycles

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