Ross J. Kang

activity

20082026

most citedOn r-dynamic Coloring of Grids

37 citations · 312 across the 39 of their papers we have counts for

collaborators

Showing 2016Show all

5 papers · 1 filter

math.CO2016

A precolouring extension of Vizing's theorem

António Girão, Ross J. Kang

Fix a palette $K$ of $Δ + 1$ colours, a graph with maximum degree $Δ$ , and a subset $M$ of the edge set with minimum distance between edges at least $9$ . If the edges of $M$ …

math.CO2016

Discrepancy and large dense monochromatic subsets

Ross Kang, Viresh Patel, Guus Regts

Erdős and Pach (1983) introduced the natural degree-based generalisations of Ramsey numbers, where instead of seeking large monochromatic cliques in a $2$ -edge coloured complete gr…

math.CO2016★ 7 cited

Squared chromatic number without claws or large cliques

Wouter Cames van Batenburg, Ross J. Kang

Let $G$ be a claw-free graph on $n$ vertices with clique number $ω$ , and consider the chromatic number $χ (G^{2})$ of the square $G^{2}$ of $G$ . Writing $χ_{s}^{'} (d)$ for the supremum of $χ…

math.CO2016

Colouring squares of claw-free graphs

Rémi de Joannis de Verclos, Ross J. Kang, Lucas Pastor

Is there some absolute $ε > 0$ such that for any claw-free graph $G$ , the chromatic number of the square of $G$ satisfies $χ (G^{2}) \leq (2 - ε) ω (G)^{2}$ , where $ω(G)…

math.CO2016

Packing graphs of bounded codegree

Wouter Cames van Batenburg, Ross J. Kang

Two graphs $G_{1}$ and $G_{2}$ on $n$ vertices are said to pack if there exist injective mappings of their vertex sets into $[n]$ such that the images of their edge sets are disjoint.…