Large expander subgraphs in high genus triangulations
arXiv:2602.14984
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.