22 citations · 51 across the 21 of their papers we have counts for
28 papers
On Balance, To What Degree is Burr's Conjecture True?
Shagnik Das, Bruce Reed, Jozef Skokan
For many trees , the Ramsey number of , denoted by , is determined by the sizes of the partition classes in its unique bipartition. In 1976, Burr proved that…
New results on the odd- and unique-Ramsey numbers
Shagnik Das, Ying-Sian Wu
The odd-Ramsey number of a graph is the minimum number of colors needed to edge-color so that in every copy of some color occurs an odd number o…
Stability for hyperplane covers
Shagnik Das, Valjakas Djaljapayan, Yen-chi Roger Lin +1
An almost -cover of the hypercube is a collection of hyperplanes that avoids the origin and covers every other vertex at least times. When is large wit…
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…
Schur properties of randomly perturbed sets
Shagnik Das, Charlotte Knierim, Patrick Morris
A set of integers is said to be \emph{Schur} if any two-colouring of results in monochromatic and with . We study the following problem: how many random in…