Faculty

Institution

Unit

Venue

Tom Kelly

Assistant Professor

Georgia Institute of Technology

Affiliations

College of Sciences

School of Mathematics

Tom Kelly is currently serving as a College Of Sciences Assistant Professor at Georgia Institute of Technology.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Tom Kelly

Georgia Institute of Technology

Assistant Professor

You can click a keyword to filter the displayed items

graph theory combinatorial theory combinatorics mathematics extremal graph theory applied mathematics discrete mathematics hypergraph theory algebraic graph theory computer science computational complexity discrete algorithms combinatorial optimization extremal combinatorics chromatic index structural graph theory topological graph theory theoretical computer science mathematical sciences lower bounds algebraic combinatorics probabilistic graph theory geometric graph theory planar graphs linear hypergraph neuroscience geometry and topology number theory mathematical analysis geometric topology spectral theory mathematical optimization fractional calculus combinatorial methods combinatorial design theory combinatorial problems combinatory analysis extremal set theory randomized algorithms random graphs graph sparsity metric graph theory graph analysis communication complexity enumerative combinatorics probabilistic computations morphological analysis numerical stability stability analysis feedback vertex sets minimum size local epsilon version maximum number local sparsity open problems hypergraph colourings nibble methods lovász conjecture rainbow hamilton path triangle-free graphs erdős-faber-lovasz conjecture subcubic graphs largest induced forest design optimization computational optimization

Notable Scholarly Works

Notable Federal Grants

Collaborators

Fractional Coloring With Local Demands and Applications to Degree-Sequence Bounds on the Independence Number. Journal of Combinatorial Theory Series B (2024)

Tom KellyLuke Postle

combinatoricslocal demandscombinatorial theoryfractional coloringindependence number

Improving the Caro–Wei Bound and Applications to TuráN Stability. Discrete Applied Mathematics (2024)

Tom KellyLuke Postle

materials sciencenumerical stabilitysurface sciencecaro-wei boundstability analysisdiscrete mathematicsstabilityapplied mathematics

Optimal Spread for Spanning Subgraphs of Dirac Hypergraphs. Journal of Combinatorial Theory Series B (2024)

Tom KellyAlp MüyesserAlexey Pokrovskiy

combinatoricsgraph theorycombinatorial theoryoptimal spreadcomputer sciencedirac hypergraphshypergraph theory

Perfect Matchings in Random Sparsifications of Dirac Hypergraphs. COMBINATORICA (2024)

Dong Yeap KangTom KellyDaniela KühnDeryk OsthusVincent Pfenninger

combinatoricsrandom sparsificationsgraph theoryperfect matchingsdirac hypergraphshypergraph theory

Solution to a Problem of ErdőS on the Chromatic Index of Hypergraphs With Bounded Codegree. Proceedings of the London Mathematical Society (2024)

Dong Yeap KangTom KellyDaniela KühnAbhishek MethukuDeryk Osthus

combinatoricsalgebraic graph theoryextremal graph theoryextremal combinatoricsbounded codegreegraph theorycomputational complexitydiscrete algorithmscombinatorial theorymaximum codegreechromatic indexdiscrete mathematicsmathematicshypergraph theory

A Proof of the ErdőS--Faber--LováSz Conjecture. Annals of Mathematics (2023)

Dong KangTom KellyDaniela KühnAbhishek MethukuDeryk Osthus

combinatoricsextremal graph theoryalgebraic graph theoryextremal combinatoricsmathematical sciencesgraph theorytopological graph theorycombinatorial theorylovász conjecturechromatic indexlinear hypergraphdiscrete mathematicsmathematicsapplied mathematicshypergraph theory

A Special Case of Vu’s Conjecture: Colouring Nearly Disjoint Graphs of Bounded Maximum Degree. Combinatorics Probability Computing (2023)

Tom KellyDaniela KühnDeryk Osthus

combinatoricsextremal graph theoryalgebraic graph theorydisjoint graphsprobabilistic computationsgraph theoryprobabilistic graph theorybounded maximum degreecombinatorial theorymathematics

Graph and Hypergraph Colouring via Nibble Methods: A Survey. EMS Press eBooks (2023)

Dong Yeap KangTom KellyDaniela KühnAbhishek MethukuDeryk Osthus

random graphscombinatoricsextremal graph theorystructural graph theoryopen problemsgraph theorydiscrete algorithmscombinatorial theorynibble methodshypergraph colouringsdiscrete mathematicsmathematicsapplied mathematicshypergraph theory

On the Density of Critical Graphs With No Large Cliques. COMBINATORICA (2023)

Tom KellyLuke Postle

combinatoricscritical graphsgraph theorytopological graph theorycombinatorial theory

Thresholds for Latin Squares and Steiner Triple Systems: Bounds Within a Logarithmic Factor. (2023)

Dong Yeap KangTom KellyDaniela KühnAbhishek MethukuDeryk Osthus

combinatoricstheory of computationlower boundsextremal combinatoricsdiscrete mathematicsgraph theorycomputational complexitydiscrete algorithmscommunication complexitycombinatorial theorylogarithmic factortheoretical computer sciencesteiner triple systemscombinatorial optimizationapplied mathematicscomputer sciencelatin squaresmathematics

1
2
3
10 / page

Tom Kelly

Assistant Professor

Georgia Institute of Technology

Affiliations

College of Sciences

School of Mathematics

Tom Kelly is currently serving as a College Of Sciences Assistant Professor at Georgia Institute of Technology.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Tom Kelly

Georgia Institute of Technology

Assistant Professor

You can click a keyword to filter the displayed items

Notable Scholarly Works

Notable Federal Grants

Collaborators

Fractional Coloring With Local Demands and Applications to Degree-Sequence Bounds on the Independence Number. Journal of Combinatorial Theory Series B (2024)

Tom KellyLuke Postle

combinatoricslocal demandscombinatorial theoryfractional coloringindependence number

Improving the Caro–Wei Bound and Applications to TuráN Stability. Discrete Applied Mathematics (2024)

Tom KellyLuke Postle

materials sciencenumerical stabilitysurface sciencecaro-wei boundstability analysisdiscrete mathematicsstabilityapplied mathematics

Optimal Spread for Spanning Subgraphs of Dirac Hypergraphs. Journal of Combinatorial Theory Series B (2024)

Tom KellyAlp MüyesserAlexey Pokrovskiy

combinatoricsgraph theorycombinatorial theoryoptimal spreadcomputer sciencedirac hypergraphshypergraph theory

Perfect Matchings in Random Sparsifications of Dirac Hypergraphs. COMBINATORICA (2024)

Dong Yeap KangTom KellyDaniela KühnDeryk OsthusVincent Pfenninger

combinatoricsrandom sparsificationsgraph theoryperfect matchingsdirac hypergraphshypergraph theory

Solution to a Problem of ErdőS on the Chromatic Index of Hypergraphs With Bounded Codegree. Proceedings of the London Mathematical Society (2024)

Dong Yeap KangTom KellyDaniela KühnAbhishek MethukuDeryk Osthus

A Proof of the ErdőS--Faber--LováSz Conjecture. Annals of Mathematics (2023)

Dong KangTom KellyDaniela KühnAbhishek MethukuDeryk Osthus

A Special Case of Vu’s Conjecture: Colouring Nearly Disjoint Graphs of Bounded Maximum Degree. Combinatorics Probability Computing (2023)

Tom KellyDaniela KühnDeryk Osthus

combinatoricsextremal graph theoryalgebraic graph theorydisjoint graphsprobabilistic computationsgraph theoryprobabilistic graph theorybounded maximum degreecombinatorial theorymathematics

Graph and Hypergraph Colouring via Nibble Methods: A Survey. EMS Press eBooks (2023)

Dong Yeap KangTom KellyDaniela KühnAbhishek MethukuDeryk Osthus

On the Density of Critical Graphs With No Large Cliques. COMBINATORICA (2023)

Tom KellyLuke Postle

combinatoricscritical graphsgraph theorytopological graph theorycombinatorial theory

Thresholds for Latin Squares and Steiner Triple Systems: Bounds Within a Logarithmic Factor. (2023)

Dong Yeap KangTom KellyDaniela KühnAbhishek MethukuDeryk Osthus

1
2
3
10 / page

Similar Faculty Members

Anton Bernshteyn

Institution

Georgia Institute of Technology

general system

extremal graph theory

Patrick Bennett

Institution

Western Michigan University

discrete algorithm

combinatorics

Theodore Molla

Institution

University of South Florida

discrete algorithm

probabilistic graph theory

Brendan T. Nagle

Institution

University of South Florida

hypergraph theory

combinatorics

Bernard Lidický

Institution

Iowa State University

discrete algorithm

extremal graph theory

Michael Tait

Institution

Villanova University

graph theory

applied mathematics

Xingxing Yu

Institution

Georgia Institute of Technology

discrete algorithm

extremal graph theory

Ryan Martin

Institution

Iowa State University

extremal graph theory

extremal poset theory

Matija Bucic

Institution

Princeton University

graph theory

mathematics

Jason McCullough

Institution

Iowa State University

algebra

commutative algebra

Similar Faculty Members

Anton Bernshteyn

Institution

Georgia Institute of Technology

general system

extremal graph theory

Patrick Bennett

Institution

Western Michigan University

discrete algorithm

combinatorics

Theodore Molla

Institution

University of South Florida

discrete algorithm

probabilistic graph theory

Brendan T. Nagle

Institution

University of South Florida

hypergraph theory

combinatorics

Bernard Lidický

Institution

Iowa State University

discrete algorithm

extremal graph theory

Michael Tait

Institution

Villanova University

graph theory

applied mathematics

Xingxing Yu

Institution

Georgia Institute of Technology

discrete algorithm

extremal graph theory

Ryan Martin

Institution

Iowa State University

extremal graph theory

extremal poset theory

Matija Bucic

Institution

Princeton University

graph theory

mathematics

Jason McCullough

Institution

Iowa State University

algebra

commutative algebra