Sayan Gupta

collaborators

5 papers

math.CO2026

A higher-connectivity spectral Ore theorem for triangle-free graphs

Joyentanuj Das, Sayan Gupta

Let $B_{n, k}$ be the graph obtained from the balanced complete bipartite graph on $n$ vertices by deleting a matching of size $k$ . If $G$ is an $n$ -vertex triangle-free graph with…

math.CO2026

On Ramsey goodness of $K_{2, n}$ versus cycles

Abisek Dewan, Sayan Gupta, Rajiv Mishra

A graph $G$ is called $H$ -good if $R (G, H) = (∣ G ∣ - 1) (I ¨ (H) - 1) + I ¨ (H)$ , where $I ¨ (H)$ denotes the size of the smallest color class in a $I ¨ (H)$ -coloring of $H$ . In Ramsey theory, it is…

math.CO2026

On Ramsey number of $K_{2, n}$ versus even cycles

Abisek Dewan, Sayan Gupta, Rajiv Mishra

For graphs $G$ and $H$ , the Ramsey number $R (G, H)$ is the smallest integer $N$ such that every graph $I^$ on $N$ vertices contains $G$ or its complement $I^$ contains $H$ …

math.CO2026

An exact Ramsey number of large bipartite graphs versus odd wheel

Sayan Gupta, Kaushik Majumder

The Ramsey number for the pair of graphs $K_{1, n}$ (star) versus $W_{m}$ (wheel) has been extensively studied. In contrast, the Ramsey number of $K_{2, n}$ versus…

math.CO2025

A study of two Ramsey numbers involving odd cycles

Sayan Gupta

The \emph{book graph} of order $(n + 2)$ , denoted by $B_{n}$ , is the graph with $n$ distinct copies of triangles sharing a common edge called the `base'. A cycle of order $m$ is deno…

A higher-connectivity spectral Ore theorem for triangle-free graphs

On Ramsey goodness of K2,n​ versus cycles

On Ramsey number of K2,n​ versus even cycles

An exact Ramsey number of large bipartite graphs versus odd wheel

A study of two Ramsey numbers involving odd cycles

On Ramsey goodness of $K_{2, n}$ versus cycles

On Ramsey number of $K_{2, n}$ versus even cycles