Shagnik Das

According to our database, Shagnik Das authored at least 23 papers between 2013 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2024

Tight bounds for divisible subdivisions.

Shagnik Das, Nemanja Draganic, Raphael Steiner

J. Comb. Theory, Ser. B, March, 2024

2023

Subspace coverings with multiplicities.

Anurag Bishnoi, Simona Boyadzhiyska, Shagnik Das, Tamás Mészáros

Comb. Probab. Comput., September, 2023

Strong blocking sets and minimal codes from expander graphs.

Noga Alon, Anurag Bishnoi, Shagnik Das, Alessandro Neri

CoRR, 2023

2021

Isomorphic bisections of cubic graphs.

Shagnik Das, Alexey Pokrovskiy, Benny Sudakov

J. Comb. Theory, Ser. B, 2021

Ryser's Conjecture for <i>t</i>-intersecting hypergraphs.

Anurag Bishnoi, Shagnik Das, Patrick Morris, Tibor Szabó

J. Comb. Theory, Ser. A, 2021

2020

Vertex Ramsey properties of randomly perturbed graphs.

Shagnik Das, Patrick Morris, Andrew Treglown

Random Struct. Algorithms, 2020

Ramsey games near the critical threshold.

David Conlon, Shagnik Das, Joonkyung Lee, Tamás Mészáros

Random Struct. Algorithms, 2020

Enumerating extensions of mutually orthogonal Latin squares.

Simona Boyadzhiyska, Shagnik Das, Tibor Szabó

Des. Codes Cryptogr., 2020

Ramsey properties of randomly perturbed graphs: cliques and cycles.

Shagnik Das, Andrew Treglown

Comb. Probab. Comput., 2020

2019

Colouring set families without monochromatic <i>k</i>-chains.

Shagnik Das, Roman Glebov, Benny Sudakov, Tuan Tran

J. Comb. Theory, Ser. A, 2019

Structure and Supersaturation for Intersecting Families.

József Balogh, Shagnik Das, Hong Liu, Maryam Sharifzadeh, Tuan Tran

Electron. J. Comb., 2019

2018

Colourings without monochromatic disjoint pairs.

Dennis Clemens, Shagnik Das, Tuan Tran

Eur. J. Comb., 2018

2017

A Semi-Random Construction of Small Covering Arrays.

Shagnik Das, Tamás Mészáros

CoRR, 2017

2016

Removal and Stability for Erdös-Ko-Rado.

Shagnik Das, Tuan Tran

SIAM J. Discret. Math., 2016

The minimum number of disjoint pairs in set systems and related problems.

Shagnik Das, Wenying Gan, Benny Sudakov

Comb., 2016

2015

Intersecting families of discrete structures are typically trivial.

József Balogh, Shagnik Das, Michelle Delcourt, Hong Liu, Maryam Sharifzadeh

J. Comb. Theory, Ser. A, 2015

Comparable pairs in families of sets.

Noga Alon, Shagnik Das, Roman Glebov, Benny Sudakov

J. Comb. Theory, Ser. B, 2015

A simple removal lemma for large nearly-intersecting families.

Tuan Tran, Shagnik Das

Electron. Notes Discret. Math., 2015

Almost-Fisher families.

Shagnik Das, Benny Sudakov, Pedro Vieira

Electron. Notes Discret. Math., 2015

Sperner's Theorem and a Problem of Erdős, Katona and Kleitman.

Shagnik Das, Wenying Gan, Benny Sudakov

Comb. Probab. Comput., 2015

Most Probably Intersecting Hypergraphs.

Shagnik Das, Benny Sudakov

Electron. J. Comb., 2015

2013

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

Shagnik Das, Hao Huang, Jie Ma, Humberto Naves, Benny Sudakov

J. Comb. Theory, Ser. B, 2013

Rainbow Turán problem for even cycles.

Shagnik Das, Choongbum Lee, Benny Sudakov

Eur. J. Comb., 2013