W. Cames van Batenburg

activity

20162019

most citedThe Bollobás-Eldridge-Catlin conjecture for even girth at least

10

1 citations · 1 across the 1 of their papers we have counts for

collaborators

6 papers

math.CO2019

Structure and colour in triangle-free graphs

N. R. Aravind, Stijn Cambie, Wouter Cames van Batenburg +3

Motivated by a recent conjecture of the first author, we prove that every properly coloured triangle-free graph of chromatic number $χ$ contains a rainbow independent set of size $…

math.CO2019

Erdős-Pósa from ball packing

Wouter Cames van Batenburg, Gwenaël Joret, Arthur Ulmer

A classic theorem of Erdős and Pósa (1965) states that every graph has either $k$ vertex-disjoint cycles or a set of $O (k lo g k)$ vertices meeting all its cycles. While the standa…

math.CO2019

Large independent sets in triangle-free cubic graphs: beyond planarity

Wouter Cames van Batenburg, Jan Goedgebeur, Gwenaël Joret

Every $n$ -vertex planar triangle-free graph with maximum degree at most $3$ has an independent set of size at least $\frac{3}{8} n$ . This was first conjectured by Albertson, Bollobá…

math.CO2019

Strong cliques and forbidden cycles

Wouter Cames van Batenburg, Ross J. Kang, François Pirot

Given a graph $G$ , the strong clique number $ω_{2}^{'} (G)$ of $G$ is the cardinality of a largest collection of edges every pair of which are incident or connected by an edge in $G$ . We…

math.CO2017★ 1 cited

The Bollobás-Eldridge-Catlin conjecture for even girth at least $10$

Wouter Cames van Batenburg, Ross J. Kang

Two graphs $G_{1}$ and $G_{2}$ on $n$ vertices are said to \textit{pack} if there exist injective mappings of their vertex sets into $[n]$ such that the images of their edge sets are d…

math.CO2016

Packing graphs of bounded codegree

Wouter Cames van Batenburg, Ross J. Kang

Two graphs $G_{1}$ and $G_{2}$ on $n$ vertices are said to pack if there exist injective mappings of their vertex sets into $[n]$ such that the images of their edge sets are disjoint.…