Eoin Hurley

works on

extremal graph theory 1 flag algebras 1 maximum degree 1 pentagon counting 1 triangle-free graphs 1

From the 1 of 6 linked papers with an AI index.

collaborators

6 papers

math.CO2026

Strong edge-colouring via local flag algebras

Eoin Davey, Eoin Hurley, RÃ©mi de Joannis de Verclos +2

The strong chromatic index $I ¨ _{s}^{'} (G)$ is the smallest number of colours needed to colour the edges of a graph $G$ so that any two edges at distance at most $2$ receive different co…

math.CO2026

Local flag algebras

Eoin Davey, Eoin Hurley, RÃ©mi de Joannis de Verclos +2

The paper introduces local flag algebras, a variant of Razborov's flag algebra method that normalizes graph densities by the maximum degree instead of the number of vertices, and u…

math.CO2026

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.CO2025

Cycle-factors of regular graphs via entropy

Micha Christoph, Nemanja DraganiÄ, AntÃ³nio GirÃ£o +3

It is a classical result that a random permutation of $n$ elements has, on average, about $lo g n$ cycles. We generalise this fact to all directed $d$ -regular graphs on $n$ vertice…

math.CO2025

New bounds for linear arboricity and related problems

Micha Christoph, Nemanja DraganiÄ, AntÃ³nio GirÃ£o +3

A linear forest is a collection of vertex-disjoint paths. The Linear Arboricity Conjecture states that every graph of maximum degree $I^$ can be decomposed into at most $\lceil(Î+…

math.CO2025

Asymmetric results about graph homomorphisms

Lior Gishboliner, Eoin Hurley, Yuval Wigderson

Many important results in extremal graph theory can be roughly summarised as "if a triangle-free graph $G$ has certain properties, then it has a homomorphism to a triangle-free gra…