Tom Kelly

Orcid: 0000-0002-4040-1648

Affiliations:
  • Georgia Institute of Technology, School of Mathematics, Atlanta, GA, USA


According to our database1, Tom Kelly authored at least 20 papers between 2016 and 2024.

Collaborative distances:

Timeline

2016
2017
2018
2019
2020
2021
2022
2023
2024
0
1
2
3
4
5
4
2
3
3
1
4
1
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Perfect Matchings in Random Sparsifications of Dirac Hypergraphs.
Comb., December, 2024

A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree.
Comb. Probab. Comput., March, 2024

Fractional coloring with local demands and applications to degree-sequence bounds on the independence number.
J. Comb. Theory B, 2024

Improving the Caro-Wei bound and applications to Turán stability.
Discret. Appl. Math., 2024

2023
Hamilton transversals in random Latin squares.
Random Struct. Algorithms, March, 2023

On the Density of Critical Graphs with No Large Cliques.
Comb., February, 2023

2022
Colorings, transversals, and local sparsity.
Random Struct. Algorithms, 2022

Almost all optimally coloured complete graphs contain a rainbow Hamilton path.
J. Comb. Theory B, 2022

Bounding <i>χ</i> by a fraction of Δ for graphs without large cliques.
J. Comb. Theory B, 2022

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

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

Graph and hypergraph colouring via nibble methods: A survey.
CoRR, 2021

A proof of the Erdös-Faber-Lovász conjecture: Algorithmic aspects.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
A local epsilon version of Reed's Conjecture.
J. Comb. Theory B, 2020

2018
Exponentially many 4-list-colorings of triangle-free graphs on surfaces.
J. Graph Theory, 2018

Size of the largest induced forest in subcubic graphs of girth at least four and five.
J. Graph Theory, 2018

Fractional coloring with local demands.
CoRR, 2018

Induced 2-Degenerate Subgraphs of Triangle-Free Planar Graphs.
Electron. J. Comb., 2018

2017
Minimum size of feedback vertex sets of planar graphs of girth at least five.
Eur. J. Comb., 2017

2016
Bounds on the maximum number of minimum dominating sets.
Discret. Math., 2016


  Loading...