A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree

Tom Kelly 0001, Daniela Kühn, Deryk Osthus. A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree. Combinatorics, Probability & Computing, 33(2):179-195, March 2024. [doi]

Abstract

Abstract is missing.