most citedCounterexample to the Bougard-Joret Conjecture

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

collaborators
Showing math.COShow all

6 papers · 1 filter

math.CO20265 cited

Counterexample to the Bougard-Joret Conjecture

Joyentanuj Das, Sayan Gupta

For admissible integers , let be the minimum number of edges in a -connected graph of order 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 be the graph obtained from the balanced complete bipartite graph on vertices by deleting a matching of size . If is an -vertex triangle-free graph with…

math.CO2026

On Ramsey goodness of versus cycles

Abisek Dewan, Sayan Gupta, Rajiv Mishra

A graph is called -good if , where denotes the size of the smallest color class in a -coloring of . In Ramsey theory, it is an i…

math.CO2026

On Ramsey number of versus even cycles

Abisek Dewan, Sayan Gupta, Rajiv Mishra

For graphs and , the Ramsey number is the smallest integer such that every graph on vertices contains or its complement contains as…

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 (star) versus (wheel) has been extensively studied. In contrast, the Ramsey number of versus…

math.CO2025

A study of two Ramsey numbers involving odd cycles

Sayan Gupta

The \emph{book graph} of order , denoted by , is the graph with distinct copies of triangles sharing a common edge called the `base'. A cycle of order is deno…