92 citations · 608 across the 67 of their papers we have counts for
74 papers
Positive Lin-Lu-Yau curvature, planar graphs, and forbidden minors
Louis Esperet, Julie Semaan
Over the past few decades, several notions of graph curvature have been introduced. Among them, Ollivier curvature, defined through optimal transport, and its Lin--Lu--Yau variant…
Cops and robber in graphs with bounded vertex cover number
Prosenjit Bose, Louis Esperet, Jędrzej Hodor +3
Meyniel's conjecture states that -vertex connected graphs have cop number . The current best known upper bound is , proved independentl…
Multiparty equality in the local broadcast model
Louis Esperet, Jean-Florent Raymond
In this paper we consider the multiparty equality problem in graphs, where every vertex of a graph is given an input, and the goal of the vertices is to decide whether all inpu…
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…
Coarse cops and robber in graphs and groups
Louis Esperet, Harmender Gahlawat, Ugo Giocanti
(abstract shortened to meet arxiv's length requirements) We investigate two variants of the classical Cops and robber game in graphs, recently introduced by Lee, Martínez-Pedroza,…
Shallow brambles
Nicolas Bousquet, Wouter Cames van Batenburg, Louis Esperet +2
A graph class has polynomial expansion if there is a polynomial function such that for every graph , each of the depth- minors of has ave…