81 citations · 836 across the 70 of their papers we have counts for
Showing 2021 · math.COShow all
3 papers · 2 filters
math.CO2021
Hypergraph regularity and random sampling
Felix Joos, Jaehoon Kim, Daniela Kühn +1
Suppose a -uniform hypergraph that satisfies a certain regularity instance (that is, there is a partition of given by the hypergraph regularity lemma into a bounded numb…
math.CO2021★ 2 cited
A special case of Vu's conjecture: Coloring nearly disjoint graphs of bounded maximum degree
Tom Kelly, Daniela Kühn, Deryk Osthus
A collection of graphs is \textit{nearly disjoint} if every pair of them intersects in at most one vertex. We prove that if are nearly disjoint graphs of maximum…
math.CO2021★ 3 cited
Graph and hypergraph colouring via nibble methods: A survey
Dong Yeap Kang, Tom Kelly, Daniela Kühn +2
This paper provides a survey of methods, results, and open problems on graph and hypergraph colourings, with a particular emphasis on semi-random `nibble' methods. We also give a d…