9 citations · 33 across the 9 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
math.CO2023★ 1 cited
Colouring random graphs: Tame colourings
Annika Heckel, Konstantinos Panagiotou
Given a graph G, a colouring is an assignment of colours to the vertices of G so that no two adjacent vertices are coloured the same. If all colour classes have size at most t, the…
math.CO2023
The hitting time of clique factors
Annika Heckel, Marc Kaufmann, Noela Müller +1
In a recent paper, Kahn gave the strongest possible, affirmative, answer to Shamir's problem, which had been open since the late 1970s: Let and let be divisible by $…