Large expander subgraphs in high genus triangulations
Combinatorics
2026-02-18 v2 Probability
Abstract
We prove that random triangulations of high genus contain very large expander subgraphs, answering a question of Benjamini. Our approach relies on new general criteria for arbitrary graphs to contain large expander subgraphs.
Cite
@article{arxiv.2602.14984,
title = {Large expander subgraphs in high genus triangulations},
author = {Tanguy Lions and Baptiste Louf},
journal= {arXiv preprint arXiv:2602.14984},
year = {2026}
}