6 citations · 7 across the 2 of their papers we have counts for
14 papers
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…
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…
Structure and colour in triangle-free graphs
N. R. Aravind, Stijn Cambie, Wouter Cames van Batenburg +3
Motivated by a recent conjecture of the first author, we prove that every properly coloured triangle-free graph of chromatic number contains a rainbow independent set of size $…
Regular Turán numbers and some Gan-Loh-Sudakov-type problems
Stijn Cambie, Rémi de Joannis de Verclos, Ross J. Kang
Motivated by a Gan-Loh-Sudakov-type problem, we introduce the regular Turán numbers, a natural variation on the classical Turán numbers for which the host graph is required to be r…
Strong cliques and forbidden cycles
Wouter Cames van Batenburg, Ross J. Kang, François Pirot
Given a graph , the strong clique number of is the cardinality of a largest collection of edges every pair of which are incident or connected by an edge in . We…
Occupancy fraction, fractional colouring, and triangle fraction
Ewan Davies, Rémi de Joannis de Verclos, Ross J. Kang +1
Given , there exists such that, if , then for any graph on vertices of maximum degree in which the neighbourhood of every vert…