The chromatic profile of locally bipartite graphs by Illingworth, F

“…Here we study the chromatic profile of locally bipartite graphs. We show that every <i>n</i>-vertex locally bipartite graph with minimum degree greater than 4/7 · <i>n</i> is 3-colourable (4/7 is tight) and with minimum degree greater than 6/11 · <i>n</i> is 4-colourable. …”

A note on induced Turán numbers by Illingworth, F

“…Their and subsequent work has focussed on $F$ being a complete bipartite graph. In this short note, we complement this focus by asymptotically determining the induced Turán number whenever $H$ is not bipartite and $F$ is not an independent set nor a complete bipartite graph.…”

The chromatic profile of locally colourable graphs by Illingworth, F

“…As a natural variant, \L uczak and Thomass\'{e} introduced the notion of a locally bipartite graph in which each neighbourhood is 2-colourable. …”

The chromatic profile of locally colourable graphs by Illingworth, F

“…As a natural variant, Luczak and Thomassé introduced the notion of a locally bipartite graph in which each neighbourhood is 2-colourable. …”