Eileen Robinson

activity

20242026

collaborators

6 papers

math.CO2026

An improved bound on the treewidth of planar graphs excluding a grid minor

Wouter Cames van Batenburg, Quentin Claus, Gwenaël Joret +3

We show that every planar graph with no $t \times t$ grid minor has treewidth at most $4 t + 4$ . This improves on the previously best known bound of $\frac{9}{2} t - \frac{11}{2}$ , du…

math.CO2026

Erdős-Pósa property of rooted tree minors

Quentin Claus, Gwenaël Joret, Clément Rambaud +1

Fiorini, Joret, and Wood (2013) showed that tree minors satisfy the so-called Erdős-Pósa property with a linear bound: For every tree $T$ there exists a constant $c \geq 1$ such th…

math.CO2025

Vu's conjecture holds for claw-free graphs

Linda Cook, Ross J. Kang, Eileen Robinson +1

Given a graph $G$ , let $Δ_{2} (G)$ denote the maximum number of neighbors any two distinct vertices of $G$ have in common. Vu (2002) proposed that, provided $Δ_{2} (G)$ is not too small…

math.CO2025

Chromatic discrepancy of locally $s$ -colourable graphs

Timothée Corsini, Lucas Picasarri-Arrieta, Théo Pierron +2

The chromatic discrepancy of a graph $G$ , denoted $ϕ (G)$ , is the least over all proper colourings $σ$ of $G$ of the greatest difference between the number of colours $∣ σ (V (H)) ∣$ sp…

cs.DM2024

Coloring bridge-free antiprismatic graphs

Cléophée Robin, Eileen Robinson

The coloring problem is a well-research topic and its complexity is known for several classes of graphs. However, the question of its complexity remains open for the class of antip…

math.CO2024

Path eccentricity of $k$ -AT-free graphs and application on graphs with the consecutive ones property

Paul Bastide, Claire Hilaire, Eileen Robinson

The central path problem is a variation on the single facility location problem. The aim is to find, in a given connected graph $G$ , a path $P$ minimizing its eccentricity, which i…