research
∙
06/02/2023
New bounds for odd colourings of graphs
Given a graph G, a vertex-colouring σ of G, and a subset X⊆ V(G), a colo...
share
research
∙
03/27/2023
Uniformly Random Colourings of Sparse Graphs
We analyse uniformly random proper k-colourings of sparse graphs with ma...
research
∙
11/15/2022
Acyclic colourings of graphs with obstructions
Given a graph G, a colouring of G is acyclic if it is a proper colouring...
research
∙
10/12/2022
Self-stabilization and byzantine tolerance for maximal independt setb ELF-STABILIZATION
We analyze the impact of transient and Byzantine faults on the construct...
research
∙
09/30/2021
Colouring locally sparse graphs with the first moment method
We give a short proof of a bound on the list chromatic number of graphs ...
research
∙
12/04/2020
Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces
The asymptotic dimension is an invariant of metric spaces introduced by ...
research
∙
12/03/2020
Distributed algorithms for fractional coloring
In this paper we study fractional coloring from the angle of distributed...
research
∙
04/15/2020
An algorithmic framework for colouring locally sparse graphs
We develop an algorithmic framework for graph colouring that reduces the...
research
∙
01/13/2020
Packing and covering balls in graphs excluding a minor
We prove that for every integer t> 1 there exists a constant c_t such th...
research
∙
05/15/2019
Strong chromatic index and Hadwiger number
We investigate the effect of a fixed forbidden clique minor upon the str...
research
∙
12/28/2018
Occupancy fraction, fractional colouring, and triangle fraction
Given ε>0, there exists f_0 such that, if f_0 < f <Δ^2+1, then for any g...
research
∙
12/04/2018
Colouring triangle-free graphs with local list sizes
We prove two distinct and natural refinements of a recent breakthrough r...
research
∙
08/07/2018
