Eoin Hurley

activity

20202026

most citedAn improved procedure for colouring graphs of bounded local density

16 citations · 20 across the 11 of their papers we have counts for

collaborators

Showing 2024Show all

2 papers · 1 filter

math.CO2024★ 2 cited

Upper bounds for multicolour Ramsey numbers

Paul Balister, Béla Bollobás, Marcelo Campos +5

The $r$ -colour Ramsey number $R_{r} (k)$ is the minimum $n \in N$ such that every $r$ -colouring of the edges of the complete graph $K_{n}$ on $n$ vertices contains a monochroma…

math.CO2024

Embedding induced trees in sparse expanding graphs

António Girão, Eoin Hurley

Inspired by the network routing literature \cite{aggarwal1996efficient}, we develop what we call a ``Pre-Emptive Greedy Algorithm" to embed bounded degree induced trees in sparse e…