Tom Kelly

According to our database, Tom Kelly authored at least 17 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

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

Tom Kelly, Daniela Kühn, Deryk Osthus

Comb. Probab. Comput., March, 2024

2023

Hamilton transversals in random Latin squares.

Stephen Gould, Tom Kelly

Random Struct. Algorithms, March, 2023

On the Density of Critical Graphs with No Large Cliques.

Tom Kelly, Luke Postle

Comb., February, 2023

2022

Colorings, transversals, and local sparsity.

Ross J. Kang, Tom Kelly

Random Struct. Algorithms, 2022

Almost all optimally coloured complete graphs contain a rainbow Hamilton path.

Stephen Gould, Tom Kelly, Daniela Kühn, Deryk Osthus

J. Comb. Theory, Ser. B, 2022

Bounding <i>χ</i> by a fraction of Δ for graphs without large cliques.

Marthe Bonamy, Tom Kelly, Peter Nelson, Luke Postle

J. Comb. Theory, Ser. B, 2022

2021

Corrigendum to "A local epsilon version of Reed's Conjecture" [J. Combin. Theory Ser. B 141 (2020) 181-222].

Tom Kelly, Luke Postle

J. Comb. Theory, Ser. B, 2021

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

Tom Kelly, Daniela Kühn, Deryk Osthus

CoRR, 2021

Graph and hypergraph colouring via nibble methods: A survey.

Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, Deryk Osthus

CoRR, 2021

A proof of the Erdös-Faber-Lovász conjecture: Algorithmic aspects.

Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, Deryk Osthus

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2018

Exponentially many 4-list-colorings of triangle-free graphs on surfaces.

Tom Kelly, Luke Postle

J. Graph Theory, 2018

Size of the largest induced forest in subcubic graphs of girth at least four and five.

Tom Kelly, Chun-Hung Liu

J. Graph Theory, 2018

Fractional coloring with local demands.

Tom Kelly, Luke Postle

CoRR, 2018

Induced 2-Degenerate Subgraphs of Triangle-Free Planar Graphs.

Zdenek Dvorák, Tom Kelly

Electron. J. Comb., 2018

2017

A Local Epsilon Version of Reed's Conjecture.

Tom Kelly, Luke Postle

Electron. Notes Discret. Math., 2017

Minimum size of feedback vertex sets of planar graphs of girth at least five.

Tom Kelly, Chun-Hung Liu

Eur. J. Comb., 2017

2016

Bounds on the maximum number of minimum dominating sets.

Samuel Connolly, Zachary Gabor, Anant P. Godbole, Bill Kay, Thomas Kelly

Discret. Math., 2016