Emma Hogan

activity

20242026

collaborators

Showing 2026Show all

2 papers · 1 filter

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