Emma Hogan

collaborators

4 papers

math.CO2026

Colour-balanced subgraphs

Emma Hogan, Alex Scott, Dmitry Tsarev

A $k$ -edge-coloured graph is colour-balanced if each colour appears equally often. Resolving a conjecture of Pardey and Rautenbach, we show that any colour-balanced $k$ -edge-colour…

math.CO2026

Sharp bounds for covering with large cliques and independent sets

Veronica Bitonti, Emma Hogan, Tommy Walker Mackay

Let $n (k_{1}, k_{2})$ be the least integer $n$ such that there exists a graph on $n$ vertices in which every vertex is contained in both a clique of size $k_{1}$ and an independent set o…

math.CO2025

Infinite Schnyder Woods

Louigi Addario-Berry, Emma Hogan, Lukas Michel +1

It is well-known that any finite triangulation possesses a unique maximal Schnyder wood. We introduce Schnyder woods of infinite triangulations, and prove there exists a unique max…

math.CO2025

Tight Bounds for Hypercube Minor-Universality

Emma Hogan, Lukas Michel, Alex Scott +3

Benjamini, Kalifa and Tzalik recently proved that there is an absolute constant $c > 0$ such that any graph with at most $c \cdot 2^{d} / d$ edges and no isolated vertices is a minor of th…