1 citations · 2 across the 2 of their papers we have counts for
2 papers
math.CO2023★ 1 cited
New bounds for odd colourings of graphs
Tianjiao Dai, Qiancheng Ouyang, François Pirot
Given a graph , a vertex-colouring of , and a subset , a colour is said to be \emph{odd} for in if it has an odd number of occurrenc…
math.CO2023★ 1 cited
Uniformly Random Colourings of Sparse Graphs
Eoin Hurley, François Pirot
We analyse uniformly random proper -colourings of sparse graphs with maximum degree in the regime . This regime corresponds to the lower side of the shattering t…