W. Cames van Batenburg

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 2020Show all

2 papers · 1 filter

math.CO2020★ 1 cited

Minimum maximal matchings in cubic graphs

Wouter Cames van Batenburg

We prove that every connected cubic graph with $n$ vertices has a maximal matching of size at most $\frac{5}{12} n + \frac{1}{2}$ . This confirms the cubic case of a conjecture of Ba…

math.CO2020★ 2 cited

Packing and covering balls in graphs excluding a minor

Nicolas Bousquet, Wouter Cames van Batenburg, Louis Esperet +4

We prove that for every integer $t \geq 1$ there exists a constant $c_{t}$ such that for every $K_{t}$ -minor-free graph $G$ , and every set $S$ of balls in $G$ , the minimum size of a set…