Tom Kelly

24 papers A* 1Journal 23
YearRankTypeTitle / Venue / Authors
2024 J jnl
A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree.
Comb. Probab. Comput.
Tom Kelly, Daniela Kühn, Deryk Osthus
2024 J jnl
Fractional coloring with local demands and applications to degree-sequence bounds on the independence number.
J. Comb. Theory B
Tom Kelly, Luke Postle
2024 J jnl
Improving the Caro-Wei bound and applications to Turán stability.
Discret. Appl. Math.
Tom Kelly, Luke Postle
2024 J jnl
Optimal spread for spanning subgraphs of Dirac hypergraphs.
J. Comb. Theory B
Tom Kelly, Alp Müyesser, Alexey Pokrovskiy
2024 J jnl
Perfect Matchings in Random Sparsifications of Dirac Hypergraphs.
Comb.
Dong Yeap Kang, Tom Kelly, Daniela Kühn, Deryk Osthus, Vincent Pfenninger
2023 J jnl
Hamilton transversals in random Latin squares.
Random Struct. Algorithms
Stephen Gould, Tom Kelly
2023 J jnl
On the Density of Critical Graphs with No Large Cliques.
Comb.
Tom Kelly, Luke Postle
2022 J jnl
Almost all optimally coloured complete graphs contain a rainbow Hamilton path.
J. Comb. Theory B
Stephen Gould, Tom Kelly, Daniela Kühn, Deryk Osthus
2022 J jnl
Bounding
J. Comb. Theory B
Marthe Bonamy, Tom Kelly, Peter Nelson, Luke Postle
2022 J jnl
Colorings, transversals, and local sparsity.
Random Struct. Algorithms
Ross J. Kang, Tom Kelly
2021 A* conf
A proof of the Erdös-Faber-Lovász conjecture: Algorithmic aspects.
FOCS
Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, Deryk Osthus
2021 J jnl
A special case of Vu's conjecture: Coloring nearly disjoint graphs of bounded maximum degree.
CoRR
Tom Kelly, Daniela Kühn, Deryk Osthus
2021 J jnl
Corrigendum to "A local epsilon version of Reed's Conjecture" [J. Combin. Theory Ser. B 141 (2020) 181-222].
J. Comb. Theory B
Tom Kelly, Luke Postle
2021 J jnl
Graph and hypergraph colouring via nibble methods: A survey.
CoRR
Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, Deryk Osthus
2020 J jnl
A local epsilon version of Reed's Conjecture.
J. Comb. Theory B
Tom Kelly, Luke Postle
2019 J jnl
A local epsilon version of Reed's Conjecture.
CoRR
Tom Kelly, Luke Postle
2019 J jnl
On the density of critical graphs with no large cliques.
CoRR
Tom Kelly, Luke Postle
2018 J jnl
Exponentially many 4-list-colorings of triangle-free graphs on surfaces.
J. Graph Theory
Tom Kelly, Luke Postle
2018 J jnl
Fractional coloring with local demands.
CoRR
Tom Kelly, Luke Postle
2018 J jnl
Induced 2-Degenerate Subgraphs of Triangle-Free Planar Graphs.
Electron. J. Comb.
Zdenek Dvorák, Tom Kelly
2018 J jnl
Size of the largest induced forest in subcubic graphs of girth at least four and five.
J. Graph Theory
Tom Kelly, Chun-Hung Liu
2017 J jnl
A Local Epsilon Version of Reed's Conjecture.
Electron. Notes Discret. Math.
Tom Kelly, Luke Postle
2017 J jnl
Induced 2-degenerate Subgraphs of Triangle-free Planar Graphs.
CoRR
Zdenek Dvorák, Tom Kelly
2017 J jnl
Minimum size of feedback vertex sets of planar graphs of girth at least five.
Eur. J. Comb.
Tom Kelly, Chun-Hung Liu