Joyentanuj Das

activity

20192026

most citedCounterexample to the Bougard-Joret Conjecture

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

collaborators

Showing 2026Show all

5 papers · 1 filter

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

A sharp fixed-size spectral bound for $k K_{3}$ -free graphs

Joyentanuj Das, Yamini V

For a fixed integer $k \geq 2$ , we establish a sharp adjacency-spectral upper bound for sufficiently large $m$ -edge $k K_{3}$ -free graphs. We prove \[ λ(G)\le (k-1)+\sqrt{m-k(k-1)}. \] M…

math.CO2026

Laplacian Bounds for the Dissociation Number of Regular Graphs of Matrix Rings

Joyentanuj Das

Let $Γ_{n} (q)$ be the graph whose vertices are the invertible matrices in $\Mat_n(\F_q)$, with two distinct matrices adjacent whenever their sum is singular. A dissociation set is a…

math.CO2026

On the minimum spectral radius of unicyclic graphs with a given matching number

Joyentanuj Das, Debabrota Mondal

A matching $M$ in a graph $G = (V, E)$ is a set of edges such that no two edges in $M$ share a common vertex. A matching with maximum cardinality is called a maximum matching and i…

Counterexample to the Bougard-Joret Conjecture

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

A sharp fixed-size spectral bound for kK3​-free graphs

Laplacian Bounds for the Dissociation Number of Regular Graphs of Matrix Rings

On the minimum spectral radius of unicyclic graphs with a given matching number

A sharp fixed-size spectral bound for $k K_{3}$ -free graphs