Arnab Char

collaborators

Showing math.COShow all

2 papers · 1 filter

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…

math.CO2024

An optimal chromatic bound for ( $P_{2} + P_{3}$ , gem)-free graphs

Arnab Char, T. Karthick

Given a graph $G$ , the parameters $I ¨ (G)$ and $I ¨ (G)$ respectively denote the chromatic number and the clique number of $G$ . A function $f : N \to N$ such…

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

An optimal chromatic bound for (P2​+P3​, gem)-free graphs

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

An optimal chromatic bound for ( $P_{2} + P_{3}$ , gem)-free graphs