Tom Kelly

collaborators

2 papers

math.CO2026

Improved bounds for the chromatic index of $k$ -uniform hypergraphs

Sarah Frederickson, Yanli Hao, Tom Kelly

In 1997, Alon and Kim conjectured that if $H$ is a $k$ -uniform $t$ -simple hypergraph with maximum degree $D$ sufficiently large, then the chromatic index $I ¨ ^{'} (H)$ is upper bounded…

math.CO2025

Advancing the RÃ¶dl Nibble: New bounds on matchings and the list chromatic index of hypergraphs

Stephen Gould, Tom Kelly

Let $H$ be a $(k + 1)$ -uniform hypergraph which is nearly $D$ -regular, such that any set of $i$ vertices is contained in at most $D_{i}$ edges of $H$ for each $i = 2, 3, \dots, k + 1$ . I…

Improved bounds for the chromatic index of k-uniform hypergraphs

Advancing the RÃ¶dl Nibble: New bounds on matchings and the list chromatic index of hypergraphs

Improved bounds for the chromatic index of $k$ -uniform hypergraphs