61 citations · 158 across the 23 of their papers we have counts for
26 papers
Optimal spread for spanning subgraphs of Dirac hypergraphs
Tom Kelly, Alp Müyesser, Alexey Pokrovskiy
Let and be hypergraphs on vertices, and suppose has large enough minimum degree to necessarily contain a copy of as a subgraph. We give a general method to rand…
The independence ratio of 4-cycle-free planar graphs
Tom Kelly, Sid Kolichala, Caleb McFarland +1
We prove that every -vertex planar graph with no triangle sharing an edge with a 4-cycle has independence ratio for . This…
Perfect matchings in random sparsifications of Dirac hypergraphs
Dong Yeap Kang, Tom Kelly, Daniela Kühn +2
For all integers , let be the minimum integer such that every -uniform -vertex hypergraph with minimum -degree $δ…
Large-Scale Auto-Regressive Modeling Of Street Networks
Michael Birsak, Tom Kelly, Wamiq Para +1
We present a novel generative method for the creation of city-scale road layouts. While the output of recent methods is limited in both size of the covered area and diversity, our…
Projective Urban Texturing
Yiangos Georgiou, Melinos Averkiou, Tom Kelly +1
This paper proposes a method for automatic generation of textures for 3D city meshes in immersive urban environments. Many recent pipelines capture or synthesize large quantities o…
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…
Generative Layout Modeling using Constraint Graphs
Wamiq Para, Paul Guerrero, Tom Kelly +2
We propose a new generative model for layout generation. We generate layouts in three steps. First, we generate the layout elements as nodes in a layout graph. Second, we compute c…
Fractional vertex-arboricity of planar graphs
Marthe Bonamy, František Kardoš, Tom Kelly +1
We initiate a systematic study of the fractional vertex-arboricity of planar graphs and demonstrate connections to open problems concerning both fractional coloring and the size of…
Almost all optimally coloured complete graphs contain a rainbow Hamilton path
Stephen Gould, Tom Kelly, Daniela Kühn +1
A subgraph of an edge-coloured graph is called rainbow if all of the edges of have different colours. In 1989, Andersen conjectured that every proper edge-colouring of $K_{…
A local epsilon version of Reed's Conjecture
Tom Kelly, Luke Postle
In 1998, Reed conjectured that every graph satisfies , where is the chromatic number of , is the maximum d…
On the density of critical graphs with no large cliques
Tom Kelly, Luke Postle
A graph is \textit{-critical} if and every proper subgraph of is -colorable, and if is a list-assignment for , then is \textit{-critica…
Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
Tom Kelly, Luke Postle
In a fractional coloring, vertices of a graph are assigned measurable subsets of the real line and adjacent vertices receive disjoint subsets; the fractional chromatic number of a…
Simplifying Urban Data Fusion with BigSUR
Tom Kelly, Niloy J. Mitra
Our ability to understand data has always lagged behind our ability to collect it. This is particularly true in urban environments, where mass data capture is particularly valuable…
FrankenGAN: Guided Detail Synthesis for Building Mass-Models Using Style-Synchonized GANs
Tom Kelly, Paul Guerrero, Anthony Steed +2
Coarse building mass models are now routinely generated at scales ranging from individual buildings through to whole cities. For example, they can be abstracted from raw measuremen…
The structure of binary matroids with no induced claw or Fano plane restriction
Marthe Bonamy, Frantisek Kardos, Tom Kelly +2
An 'induced restriction' of a simple binary matroid is a restriction , where is a flat of . We consider the class of all simple binary matroids co…
Bounding by a fraction of for graphs without large cliques
Marthe Bonamy, Tom Kelly, Peter Nelson +1
The greedy coloring algorithm shows that a graph of maximum degree at most has chromatic number at most , and this is tight for cliques. Much attention has been devoted t…
Induced 2-degenerate Subgraphs of Triangle-free Planar Graphs
Zdeněk Dvořák, Tom Kelly
A graph is -degenerate if every subgraph has minimum degree at most . We provide lower bounds on the size of a maximum induced 2-degenerate subgraph in a triangle-free planar…
Minimum Size of Feedback Vertex Sets of Planar Graphs of Girth at least Five
Tom Kelly, Chun-Hung Liu
A feedback vertex set of a graph is a subset of vertices intersecting all cycles. We provide tight upper bounds on the size of a minimum feedback vertex set in planar graphs of gir…