Sublinear expanders and their applications
Combinatorics
2024-09-16 v1
Abstract
In this survey we aim to give a comprehensive overview of results using sublinear expanders. The term sublinear expanders refers to a variety of definitions of expanders, which typically are defined to be graphs such that every not-too-small and not-too-large set of vertices has neighbourhood of size at least , where is a function of and . This is in contrast with linear expanders, where is typically a constant. :We will briefly describe proof ideas of some of the results mentioned here, as well as related open problems.
Cite
@article{arxiv.2401.10865,
title = {Sublinear expanders and their applications},
author = {Shoham Letzter},
journal= {arXiv preprint arXiv:2401.10865},
year = {2024}
}
Comments
39 pages, 15 figures. This survey will appear in `Surveys in Combinatorics 2024' (the proceedings of the 30th British Combinatorial Conference)