61 citations · 158 across the 23 of their papers we have counts for
7 papers · 1 filter
Seamless Satellite-image Synthesis
Jialin Zhu, Tom Kelly
We introduce Seamless Satellite-image Synthesis (SSS), a novel neural architecture to create scale-and-space continuous satellite textures from cartographic data. While 2D map data…
Solution to a problem of Erdős on the chromatic index of hypergraphs with bounded codegree
Dong Yeap Kang, Tom Kelly, Daniela Kühn +2
In 1977, Erdős asked the following question: for any integers , if are complete graphs such that each has at most vertices and eve…
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…
SketchGen: Generating Constrained CAD Sketches
Wamiq Reyaz Para, Shariq Farooq Bhat, Paul Guerrero +4
Computer-aided design (CAD) is the most widely used modeling approach for technical design. The typical starting point in these designs is 2D sketches which can later be extruded a…
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…
Hamilton transversals in random Latin squares
Stephen Gould, Tom Kelly
Gyárfás and Sárközy conjectured that every Latin square has a `cycle-free' partial transversal of size . We confirm this conjecture in a strong sense for almost al…
A proof of the Erdős-Faber-Lovász conjecture
Dong Yeap Kang, Tom Kelly, Daniela Kühn +2
The Erdős-Faber-Lovász conjecture (posed in 1972) states that the chromatic index of any linear hypergraph on vertices is at most . In this paper, we prove this conjecture f…