Rainbow Turán problem for even cycles. - Shagnik Das; Choongbum Lee; Benny Sudakov (Eur. J. Comb., 2013)

A problem of Erdős on the minimum number of k-cliques. - Shagnik Das; Hao Huang 005; Jie Ma; Humberto Naves; Benny Sudakov (J. Comb. Theory B, 2013)

Most Probably Intersecting Hypergraphs. - Shagnik Das; Benny Sudakov (Electron. J. Comb., 2015)

Sperner's Theorem and a Problem of Erdős, Katona and Kleitman. - Shagnik Das; Wenying Gan; Benny Sudakov (Comb. Probab. Comput., 2015)

Almost-Fisher families. - Shagnik Das; Benny Sudakov; Pedro Vieira 003 (Electron. Notes Discret. Math., 2015)

A simple removal lemma for large nearly-intersecting families. - Tuan Tran; Shagnik Das (Electron. Notes Discret. Math., 2015)

Comparable pairs in families of sets. - Noga Alon; Shagnik Das; Roman Glebov; Benny Sudakov (J. Comb. Theory B, 2015)

Intersecting families of discrete structures are typically trivial. - József Balogh; Shagnik Das; Michelle Delcourt; Hong Liu 010; Maryam Sharifzadeh (J. Comb. Theory A, 2015)

The minimum number of disjoint pairs in set systems and related problems. - Shagnik Das; Wenying Gan; Benny Sudakov (Comb., 2016)

Removal and Stability for Erdös-Ko-Rado. - Shagnik Das; Tuan Tran (SIAM J. Discret. Math., 2016)

A Semi-Random Construction of Small Covering Arrays. - Shagnik Das; Tamás Mészáros 001 (CoRR, 2017)

Colourings without monochromatic disjoint pairs. - Dennis Clemens; Shagnik Das; Tuan Tran (Eur. J. Comb., 2018)

Structure and Supersaturation for Intersecting Families. - József Balogh; Shagnik Das; Hong Liu 010; Maryam Sharifzadeh; Tuan Tran (Electron. J. Comb., 2019)

Colouring set families without monochromatic k-chains. - Shagnik Das; Roman Glebov; Benny Sudakov; Tuan Tran (J. Comb. Theory A, 2019)

Ramsey properties of randomly perturbed graphs: cliques and cycles. - Shagnik Das; Andrew Treglown (Comb. Probab. Comput., 2020)

Enumerating extensions of mutually orthogonal Latin squares. - Simona Boyadzhiyska; Shagnik Das; Tibor Szabó (Des. Codes Cryptogr., 2020)

Ramsey games near the critical threshold. - David Conlon; Shagnik Das; Joonkyung Lee; Tamás Mészáros 001 (Random Struct. Algorithms, 2020)

Vertex Ramsey properties of randomly perturbed graphs. - Shagnik Das; Patrick Morris 001; Andrew Treglown (Random Struct. Algorithms, 2020)

Ryser's Conjecture for t-intersecting hypergraphs. - Anurag Bishnoi; Shagnik Das; Patrick Morris 001; Tibor Szabó (J. Comb. Theory A, 2021)

Isomorphic bisections of cubic graphs. - Shagnik Das; Alexey Pokrovskiy; Benny Sudakov (J. Comb. Theory B, 2021)

Covering grids with multiplicity. - Anurag Bishnoi; Simona Boyadzhiyska; Shagnik Das; Yvonne Den Bakker (Comb. Theory, 2023)

Strong blocking sets and minimal codes from expander graphs. - Noga Alon; Anurag Bishnoi; Shagnik Das; Alessandro Neri 002 (CoRR, 2023)

Subspace coverings with multiplicities. - Anurag Bishnoi; Simona Boyadzhiyska; Shagnik Das; Tamás Mészáros 001 (Comb. Probab. Comput., 2023)

Schur properties of randomly perturbed sets. - Shagnik Das; Charlotte Knierim; Patrick Morris 001 (Eur. J. Comb., 2024)

Tight bounds for divisible subdivisions. - Shagnik Das; Nemanja Draganic; Raphael Steiner (J. Comb. Theory B, 2024)

Bounded Fractional Intersecting Families are Linear in Size. - Niranjan Balachandran; Shagnik Das; Brahadeesh Sankarnarayanan (Electron. J. Comb., 2025)

Ramsey simplicity of random graphs. - Simona Boyadzhiyska; Dennis Clemens; Shagnik Das; Pranshu Gupta (Comb. Probab. Comput., 2025)

Odd-Ramsey numbers of complete bipartite graphs. - Simona Boyadzhiyska; Shagnik Das; Thomas Lesgourgues; Kalina Petrova (Eur. J. Comb., 2026)