activity
20142026
most citedA tight Erdős-Pósa function for planar minors

8 citations · 36 across the 26 of their papers we have counts for

collaborators
Showing 2021Show all

2 papers · 1 filter

math.CO2021★ 5 cited

Packing list-colourings

Stijn Cambie, Wouter Cames van Batenburg, Ewan Davies +1

List colouring is an influential and classic topic in graph theory. We initiate the study of a natural strengthening of this problem, where instead of one list-colouring, we seek m…

math.CO2021

Maximising line subgraphs of diameter at most

Stijn Cambie, Wouter Cames van Batenburg, Rémi de Joannis de Verclos +1

We wish to bring attention to a natural but slightly hidden problem, posed by Erdős and Nešetřil in the late 1980s, an edge version of the degree--diameter problem. Our main result…