Tom Kelly

activity

20162023

most citedSketchGen: Generating Constrained CAD Sketches

26 citations · 27 across the 4 of their papers we have counts for

collaborators

Showing math.COShow all

6 papers · 1 filter

math.CO2023

Optimal spread for spanning subgraphs of Dirac hypergraphs

Tom Kelly, Alp Müyesser, Alexey Pokrovskiy

Let $G$ and $H$ be hypergraphs on $n$ vertices, and suppose $H$ has large enough minimum degree to necessarily contain a copy of $G$ as a subgraph. We give a general method to rand…

math.CO2023

The independence ratio of 4-cycle-free planar graphs

Tom Kelly, Sid Kolichala, Caleb McFarland +1

We prove that every $n$ -vertex planar graph $G$ with no triangle sharing an edge with a 4-cycle has independence ratio $n / α (G) \leq 4 - ε$ for $ε = 1/30$ . This…

math.CO2020★ 1 cited

Fractional vertex-arboricity of planar graphs

Marthe Bonamy, František Kardoš, Tom Kelly +1

We initiate a systematic study of the fractional vertex-arboricity of planar graphs and demonstrate connections to open problems concerning both fractional coloring and the size of…

math.CO2018

The structure of binary matroids with no induced claw or Fano plane restriction

Marthe Bonamy, Frantisek Kardos, Tom Kelly +2

An 'induced restriction' of a simple binary matroid $M$ is a restriction $M ∣ F$ , where $F$ is a flat of $M$ . We consider the class $M$ of all simple binary matroids $M$ co…

math.CO2018

Bounding $χ$ by a fraction of $Δ$ for graphs without large cliques

Marthe Bonamy, Tom Kelly, Peter Nelson +1

The greedy coloring algorithm shows that a graph of maximum degree at most $Δ$ has chromatic number at most $Δ + 1$ , and this is tight for cliques. Much attention has been devoted t…

math.CO2016

Exponentially Many 4-List-Colorings of Triangle-Free Graphs on Surfaces

Tom Kelly, Luke Postle

Thomassen proved that every planar graph $G$ on $n$ vertices has at least $2^{n /9}$ distinct $L$ -colorings if $L$ is a 5-list-assignment for $G$ and at least $2^{n /10000}$ distinct…