Sayan Gupta

most citedCounterexample to the Bougard-Joret Conjecture

5 citations · 5 across the 3 of their papers we have counts for

collaborators

4 papers

math.CO2026★ 5 cited

Counterexample to the Bougard-Joret Conjecture

Joyentanuj Das, Sayan Gupta

For admissible integers $n, α, k$ , let $f (n, α, k)$ be the minimum number of edges in a $k$ -connected graph of order $n$ and independence number $α$ . A conjecture of Bougard and Joret…

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.CO2025

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…