Clément Rambaud

activity

20212026

most citedProblems, proofs, and disproofs on the inversion number

3 citations · 8 across the 25 of their papers we have counts for

collaborators

Showing 2025 · math.COShow all

3 papers · 2 filters

math.CO2025

Making an oriented graph acyclic using inversions of bounded or prescribed size

Jørgen Bang-Jensen, Frédéric Havet, Florian Hörsch +3

Given an oriented graph $D$ , the inversion of a subset $X$ of vertices consists in reversing the orientation of all arcs with both endpoints in $X$ . When the subset $X$ is of size…

math.CO2025

Faithful universal graphs for minor-closed classes

Paul Bastide, Louis Esperet, Carla Groenland +3

It was proved by Huynh, Mohar, Šámal, Thomassen and Wood in 2021 that any countable graph containing every countable planar graph as a subgraph has an infinite clique minor. We pro…

math.CO2025

Excluding a rectangular grid

Clément Rambaud

For every positive integer $k$ , we define the $k$ -treedepth as the largest graph parameter $td_{k}$ satisfying (i) $td_{k} (\emptyset) = 0$ ; (ii) $\mathrm{td}_k(G) \leq…