37 citations · 312 across the 39 of their papers we have counts for
6 papers · 1 filter
On a Ramsey-type problem of Erdős and Pach
Ross J. Kang, Eoin Long, Viresh Patel +1
In this paper we show that there exists a constant such that for any graph on vertices either or its complement has an induced subgraph on ver…
Decomposition of bounded degree graphs into -free subgraphs
Ross J. Kang, Guillem Perarnau
We prove that every graph with maximum degree admits a partition of its edges into parts (as ) none of which contains as a subgraph. This bound is…
On r-dynamic Coloring of Grids
Ross Kang, Tobias Muller, Douglas B. West
An \textit{-dynamic -coloring} of a graph is a proper -coloring of such that every vertex in has neighbors in at least different color clas…
Extension from Precoloured Sets of Edges
Katherine Edwards, António Girão, Jan van den Heuvel +3
We consider precolouring extension problems for proper edge-colourings of graphs and multigraphs, in an attempt to prove stronger versions of Vizing's and Shannon's bounds on the c…
Bounded monochromatic components for random graphs
Nicolas Broutin, Ross J. Kang
We consider vertex partitions of the binomial random graph . For , we observe the following phenomenon: in any partition into asymptotically fewer than $χ(G_{…
A precise threshold for quasi-Ramsey numbers
Ross J. Kang, János Pach, Viresh Patel +1
We consider a variation of Ramsey numbers introduced by Erdős and Pach (1983), where instead of seeking complete or independent sets we only seek a -homogeneous set, a vertex su…