Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTom Kelly 0001
Person information
- affiliation: Georgia Institute of Technology, School of Mathematics, Atlanta, GA, USA
Other persons with the same name
- Tom Kelly — disambiguation page
- Thomas Kelly — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j14]Tom Kelly
, Daniela Kühn, Deryk Osthus:
A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree. Comb. Probab. Comput. 33(2): 179-195 (2024)- 2023
- [j13]Tom Kelly, Luke Postle:
On the Density of Critical Graphs with No Large Cliques. Comb. 43(1): 57-89 (2023) - [j12]Stephen Gould, Tom Kelly:
Hamilton transversals in random Latin squares. Random Struct. Algorithms 62(2): 450-478 (2023) - 2022
- [j11]Stephen Gould, Tom Kelly, Daniela Kühn, Deryk Osthus:
Almost all optimally coloured complete graphs contain a rainbow Hamilton path. J. Comb. Theory B 156: 57-100 (2022) - [j10]Marthe Bonamy, Tom Kelly, Peter Nelson, Luke Postle:
Bounding χ by a fraction of Δ for graphs without large cliques. J. Comb. Theory B 157: 263-282 (2022) - [j9]Ross J. Kang, Tom Kelly:
Colorings, transversals, and local sparsity. Random Struct. Algorithms 61(1): 173-192 (2022) - 2021
- [j8]Tom Kelly, Luke Postle:
Corrigendum to "A local epsilon version of Reed's Conjecture" [J. Combin. Theory Ser. B 141 (2020) 181-222]. J. Comb. Theory B 151: 509-512 (2021) - 2020
- [j7]Tom Kelly, Luke Postle:
A local epsilon version of Reed's Conjecture. J. Comb. Theory B 141: 181-222 (2020) - 2018
- [j6]Zdenek Dvorák, Tom Kelly:
Induced 2-Degenerate Subgraphs of Triangle-Free Planar Graphs. Electron. J. Comb. 25(1): 1 (2018) - [j5]Tom Kelly, Luke Postle:
Exponentially many 4-list-colorings of triangle-free graphs on surfaces. J. Graph Theory 87(2): 230-238 (2018) - [j4]Tom Kelly, Chun-Hung Liu:
Size of the largest induced forest in subcubic graphs of girth at least four and five. J. Graph Theory 89(4): 457-478 (2018) - 2017
- [j3]Tom Kelly, Chun-Hung Liu:
Minimum size of feedback vertex sets of planar graphs of girth at least five. Eur. J. Comb. 61: 138-150 (2017) - [j2]Tom Kelly, Luke Postle:
A Local Epsilon Version of Reed's Conjecture. Electron. Notes Discret. Math. 61: 719-725 (2017) - 2016
- [j1]Samuel Connolly, Zachary Gabor, Anant P. Godbole, Bill Kay, Thomas Kelly:
Bounds on the maximum number of minimum dominating sets. Discret. Math. 339(5): 1537-1542 (2016)
Conference and Workshop Papers
- 2021
- [c1]Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, Deryk Osthus:
A proof of the Erdös-Faber-Lovász conjecture: Algorithmic aspects. FOCS 2021: 1080-1089
Informal and Other Publications
- 2021
- [i6]Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, Deryk Osthus:
Graph and hypergraph colouring via nibble methods: A survey. CoRR abs/2106.13733 (2021) - [i5]Tom Kelly, Daniela Kühn, Deryk Osthus:
A special case of Vu's conjecture: Coloring nearly disjoint graphs of bounded maximum degree. CoRR abs/2109.11438 (2021) - 2019
- [i4]Tom Kelly, Luke Postle:
On the density of critical graphs with no large cliques. CoRR abs/1911.02661 (2019) - [i3]Tom Kelly, Luke Postle:
A local epsilon version of Reed's Conjecture. CoRR abs/1911.02672 (2019) - 2018
- [i2]Tom Kelly, Luke Postle:
Fractional coloring with local demands. CoRR abs/1811.11806 (2018) - 2017
- [i1]Zdenek Dvorák, Tom Kelly:
Induced 2-degenerate Subgraphs of Triangle-free Planar Graphs. CoRR abs/1709.04036 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-09 04:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
