Arnab Char

collaborators

3 papers

math.CO2026

Edge-colouring and orientations: applications to degree- and $I ¨ $ -boundedness

Arnab Char, Ken-ichi Kawarabayashi, Lucas Picasarri-Arrieta

We prove a new generalisation of Ramsey's theorem by showing that every $2$ -edge-coloured graph with sufficiently large minimum degree contains a monochromatic induced subgraph who…

cs.DM2025

On near optimal colorable graphs

C. U. Angeliya, Arnab Char, T. Karthick

A class of graphs $G$ is said to be \emph{near optimal colorable} if there exists a constant $c \in N$ such that every graph $G \in G$ satisfies $Ï(G) \leq \max\{…

cs.DM2025

$4 K_{1}$ -free graph with the cop number $3$

Arnab Char, Paras Vinubhai Maniya, Dinabandhu Pradhan

The game of cops and robber is a two-player turn-based game played on a graph where the cops try to capture the robber. The cop number of a graph $G$ , denoted by $c (G)$ is the mini…

Edge-colouring and orientations: applications to degree- and I¨-boundedness

On near optimal colorable graphs

4K1​-free graph with the cop number 3

Edge-colouring and orientations: applications to degree- and $I ¨ $ -boundedness

$4 K_{1}$ -free graph with the cop number $3$