37 citations · 312 across the 39 of their papers we have counts for
Showing 2012 · math.COShow all
3 papers · 2 filters
math.CO2012★ 6 cited
Improper choosability and Property B
Ross J. Kang
A fundamental connection between list vertex colourings of graphs and Property B (also known as hypergraph 2-colourability) was already known to Erdős, Rubin and Taylor. In this ar…
math.CO2012★ 12 cited
The distance-t chromatic index of graphs
Tomáš Kaiser, Ross J. Kang
We consider two graph colouring problems in which edges at distance at most are given distinct colours, for some fixed positive integer . We obtain two upper bounds for the…
math.CO2012★ 13 cited
Largest sparse subgraphs of random graphs
Nikolaos Fountoulakis, Ross J. Kang, Colin McDiarmid
For the Erdős-Rényi random graph G(n,p), we give a precise asymptotic formula for the size of a largest vertex subset in G(n,p) that induces a subgraph with average degree at most…