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 2021Show all

3 papers · 1 filter

math.CO2021

Tight bounds for divisible subdivisions

Shagnik Das, Nemanja Draganić, Raphael Steiner

Alon and Krivelevich proved that for every $n$ -vertex subcubic graph $H$ and every integer $q \geq 2$ there exists a (smallest) integer $f = f (H, q)$ such that every $K_{f}$ -minor contai…

math.CO2021

Ramsey simplicity of random graphs

Simona Boyadzhiyska, Dennis Clemens, Shagnik Das +1

A graph $G$ is $q$ -Ramsey for another graph $H$ if in any $q$ -edge-colouring of $G$ there is a monochromatic copy of $H$ , and the classic Ramsey problem asks for the minimum number…

math.CO2021

Subspace coverings with multiplicities

Anurag Bishnoi, Simona Boyadzhiyska, Shagnik Das +1

We study the problem of determining the minimum number $f (n, k, d)$ of affine subspaces of codimension $d$ that are required to cover all points of $\mathbb{F}_2^n\setminus \{\vec{0}…