T. Kelly

collaborators

2 papers

math.CO2026

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 / I^\pm (G) \leq 4 - ε$ for $ε = 1/30$ . This…

math.CO2024

Solution to a problem of ErdÅs on the chromatic index of hypergraphs with bounded codegree

Dong Yeap Kang, Tom Kelly, Daniela KÃ¼hn +2

In 1977, ErdÅs asked the following question: for any integers $t, n \in N$ , if $G_{1}, \dots, G_{n}$ are complete graphs such that each $G_{i}$ has at most $n$ vertices and ev…

The independence ratio of 4-cycle-free planar graphs

Solution to a problem of ErdÅs on the chromatic index of hypergraphs with bounded codegree

Solution to a problem of ErdÅs on the chromatic index of hypergraphs with bounded codegree