30 citations · 74 across the 13 of their papers we have counts for
5 papers · 2 filters
Universality for graphs with bounded density
Noga Alon, Natalie Dodson, Carmen Jackson +3
A graph is for a (finite) family of graphs if every is a subgraph of . For a given family , the goal is t…
Prime and polynomial distances in colourings of the plane
James Davies, Rose McCarty, Michał Pilipczuk
We give two extensions of the recent theorem of the first author that the odd distance graph has unbounded chromatic number. The first is that for any non-constant polynomial w…
Decomposing a signed graph into rooted circuits
Rose McCarty
We prove a precise min-max theorem for the following problem. Let be an Eulerian graph with a specified set of edges , and let be a vertex of . Then wh…
Induced -free subgraphs with large average degree
Xiying Du, António Girão, Zach Hunter +2
We prove that there exists a constant so that, for all , if has average degree at least and does not contain as a subgraph then it…
On tree decompositions whose trees are minors
Pablo Blanco, Linda Cook, Meike Hatzel +3
In 2019, Dvořák asked whether every connected graph has a tree decomposition so that is a subgraph of and the width of is bounded…