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

4 papers · 1 filter

math.CO2019

Enumerating extensions of mutually orthogonal Latin squares

Simona Boyadzhiyska, Shagnik Das, Tibor Szabó

Two $n \times n$ Latin squares $L_{1}, L_{2}$ are said to be orthogonal if, for every ordered pair $(x, y)$ of symbols, there are coordinates $(i, j)$ such that $L_{1} (i, j) = x$ and $L_2(i…

math.CO2019

Vertex Ramsey properties of randomly perturbed graphs

Shagnik Das, Patrick Morris, Andrew Treglown

Given graphs $F, H$ and $G$ , we say that $G$ is $(F, H)_{v}$ -Ramsey if every red/blue vertex colouring of $G$ containsa red copy of $F$ or a blue copy of $H$ . Results of Łuczak, Rucińs…

math.CO2019

Ramsey games near the critical threshold

David Conlon, Shagnik Das, Joonkyung Lee +1

A well-known result of Rödl and Ruciński states that for any graph $H$ there exists a constant $C$ such that if $p \geq C n^{- 1/ m_{2} (H)}$ , then the random graph $G_{n, p}$ is a.a.s.…

math.CO2019★ 22 cited

Ramsey properties of randomly perturbed graphs: cliques and cycles

Shagnik Das, Andrew Treglown

Given graphs $H_{1}, H_{2}$ , a graph $G$ is $(H_{1}, H_{2})$ -Ramsey if for every colouring of the edges of $G$ with red and blue, there is a red copy of $H_{1}$ or a blue copy of $H_{2}$ . In thi…