Tom Kelly

activity

20162023

most citedFrankenGAN: Guided Detail Synthesis for Building Mass-Models Using Style-Synchonized GANs

61 citations · 158 across the 23 of their papers we have counts for

collaborators

Showing 2019Show all

2 papers · 1 filter

math.CO2019★ 12 cited

A local epsilon version of Reed's Conjecture

Tom Kelly, Luke Postle

In 1998, Reed conjectured that every graph $G$ satisfies $χ (G) \leq ⌈ \frac{1}{2} (Δ (G) + 1 + ω (G))⌉$ , where $χ (G)$ is the chromatic number of $G$ , $Δ (G)$ is the maximum d…

math.CO2019★ 1 cited

On the density of critical graphs with no large cliques

Tom Kelly, Luke Postle

A graph $G$ is \textit{ $k$ -critical} if $χ (G) = k$ and every proper subgraph of $G$ is $(k - 1)$ -colorable, and if $L$ is a list-assignment for $G$ , then $G$ is \textit{ $L$ -critica…