37 citations · 312 across the 39 of their papers we have counts for
5 papers · 1 filter
Independent transversals in bipartite correspondence-covers
Stijn Cambie, Ross J. Kang
Suppose and are bipartite graphs and induces a partition of such that the subgraph of induced between and is a matching when…
An improved procedure for colouring graphs of bounded local density
Eoin Hurley, Rémi de Joannis de Verclos, Ross J. Kang
We develop an improved bound for the chromatic number of graphs of maximum degree under the assumption that the number of edges spanning any neighbourhood is at most $(1-σ)\bin…
An algorithmic framework for colouring locally sparse graphs
Ewan Davies, Ross J. Kang, François Pirot +1
We develop an algorithmic framework for graph colouring that reduces the problem to verifying a local probabilistic property of the independent sets. With this we give, for any fix…
Asymmetric list sizes in bipartite graphs
Noga Alon, Stijn Cambie, Ross J. Kang
Given a bipartite graph with parts and having maximum degrees at most and , respectively, consider a list assignment such that every vertex in or is give…
Graph structure via local occupancy
Ewan Davies, Ross J. Kang, François Pirot +1
The first author together with Jenssen, Perkins and Roberts (2017) recently showed how local properties of the hard-core model on triangle-free graphs guarantee the existence of la…