1 citations · 1 across the 3 of their papers we have counts for
3 papers
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…
math.CO2023
Abundance: Asymmetric Graph Removal Lemmas and Integer Solutions to Linear Equations
António Girão, Eoin Hurley, Freddie Illingworth +1
We prove that a large family of pairs of graphs satisfy a polynomial dependence in asymmetric graph removal lemmas. In particular, we give an unexpected answer to a question of Gis…
math.CO2023★ 1 cited
Uniformly Random Colourings of Sparse Graphs
Eoin Hurley, François Pirot
We analyse uniformly random proper -colourings of sparse graphs with maximum degree in the regime . This regime corresponds to the lower side of the shattering t…