92 citations · 608 across the 67 of their papers we have counts for
6 papers · 1 filter
Optimal Adjacency Labels for Subgraphs of Cartesian Products
Louis Esperet, Nathaniel Harms, Viktor Zamaraev
For any hereditary graph class , we construct optimal adjacency labeling schemes for the classes of subgraphs and induced subgraphs of Cartesian products of graphs in . As a…
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
Marthe Bonamy, Édouard Bonnet, Hugues Déprés +5
A graph is -free if it does not contain pairwise vertex-disjoint and non-adjacent cycles. We prove that "sparse" (here, not containing large complete bipartite g…
Antifactors in bipartite multigraphs
Louis Esperet
Let be a -regular bipartite graph with bipartition . It was proved by Lu, Wang, and Yan in 2020 that has a spanning subgraph such that each vertex of has…
Colouring Strong Products
Louis Esperet, David R. Wood
Recent results show that several important graph classes can be embedded as subgraphs of strong products of simpler graphs classes (paths, small cliques, or graphs of bounded treew…
Sketching Distances in Monotone Graph Classes
Louis Esperet, Nathaniel Harms, Andrey Kupavskii
We study the two-player communication problem of determining whether two vertices are nearby in a graph , with the goal of determining the graph structures that allow the…
Testability and local certification of monotone properties in minor-closed classes
Louis Esperet, Sergey Norin
The main problem in the area of graph property testing is to understand which graph properties are \emph{testable}, which means that with constantly many queries to any input graph…