A note on sublinear separators and expansion

Benjamini, 2012, On the separation profile of infinite graphs, Groups Geom. Dyn., 6, 10.4171/GGD/168 Bollobás, 1988, The isoperimetric number of random regular graphs, European J. Combin., 9, 241, 10.1016/S0195-6698(88)80014-3 Chekuri, 2015, Degree-3 treewidth sparsifiers, 242 Dvořák, 2016, Strongly sublinear separators and polynomial expansion, SIAM J. Discrete Math., 30, 1095, 10.1137/15M1017569 Dvořák, 2019, Treewidth of graphs with balanced separations, J. Combin. Theory Ser. B, 137, 137, 10.1016/j.jctb.2018.12.007 Esperet, 2018, Polynomial expansion and sublinear separators, European J. Combin., 69, 49, 10.1016/j.ejc.2017.09.003 Lipton, 1979, A separator theorem for planar graphs, SIAM J. Appl. Math., 36, 177, 10.1137/0136016 G. Miller, S.-H. Teng, S. Vavasis, Unified geometric approach to graph separators, in: Proc. 31st Ann. Symp. Foundations of Computer Science, 1991, pp. 538–547. Nešetřil, 2008, Grad and classes with bounded expansion II. Algorithmic aspects, European J. Combin., 29, 777, 10.1016/j.ejc.2006.07.014 Nešetřil, 2012, vol. 28 Plotkin, 1994, Shallow excluded minors and improved graph decompositions, 462 Robertson, 1986, Graph minors. II. Algorithmic aspects of tree-width, J. Algorithms, 7, 309, 10.1016/0196-6774(86)90023-4 Shapira, 2015, Small complete minors above the extremal edge density, Combinatorica, 35, 75, 10.1007/s00493-015-3013-2