activity
20072026
most citedAcyclic edge-coloring using entropy compression

92 citations · 608 across the 67 of their papers we have counts for

collaborators
Showing 2023Show all

5 papers · 1 filter

math.CO2023★ 4 cited

Coarse geometry of quasi-transitive graphs beyond planarity

Louis Esperet, Ugo Giocanti

We study geometric and topological properties of infinite graphs that are quasi-isometric to a planar graph of bounded degree. We prove that every locally finite quasi-transitive g…

cs.DM2023

Local certification of geometric graph classes

Oscar Defrain, Louis Esperet, Aurélie Lagoutte +2

The goal of local certification is to locally convince the vertices of a graph that satisfies a given property. A prover assigns short certificates to the vertices of the g…

math.GR2023★ 1 cited

Optimization in graphical small cancellation theory

Louis Esperet, Ugo Giocanti

Gromov (2003) constructed finitely generated groups whose Cayley graphs contain all graphs from a given infinite sequence of expander graphs of unbounded girth and bounded diameter…

math.CO2023★ 2 cited

Proof of the Clustered Hadwiger Conjecture

Vida Dujmović, Louis Esperet, Pat Morin +1

Hadwiger's Conjecture asserts that every -minor-free graph is properly -colourable. We prove the following improper analogue of Hadwiger's Conjecture: for fixed , ev…

math.CO2023

The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem

Louis Esperet, Ugo Giocanti, Clément Legrand-Duchesne

An infinite graph is quasi-transitive if its vertex set has finitely many orbits under the action of its automorphism group. In this paper we obtain a structure theorem for locally…