Expanders – how to find them, and what to find in them

DOI10.1017/9781108649094.005zbMath1476.05104arXiv1812.11562OpenAlexW2907316818MaRDI QIDQ5149169

Michael Krivelevich

Publication date: 6 February 2021

Published in: Surveys in Combinatorics 2019 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.11562

zbMATH Keywords

pathscyclesgraph minorsexpanding graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Random walks on graphs (05C81) Expander graphs (05C48)

Related Items (18)

Large complete minors in random subgraphs ⋮ Short proofs for long induced paths ⋮ Well-mixing vertices and almost expanders ⋮ Crux and Long Cycles in Graphs ⋮ Complete Minors in Graphs Without Sparse Cuts ⋮ Rolling backwards can move you forward: On embedding problems in sparse expanders ⋮ Divisible subdivisions ⋮ Site percolation on pseudo‐random graphs ⋮ Finding large expanders in graphs: from topological minors to induced subgraphs ⋮ How to build a pillar: a proof of Thomassen's conjecture ⋮ Tight bounds for divisible subdivisions ⋮ An analogue of the Erdős-Gallai theorem for random graphs ⋮ Almost spanning distance trees in subsets of finite vector spaces ⋮ Cycle lengths in expanding graphs ⋮ Perfect matching in random graphs is as hard as Tseitin ⋮ Expansion in supercritical random subgraphs of expanders and its consequences ⋮ Expansion in supercritical random subgraphs of the hypercube and its consequences ⋮ Cycle lengths modulo \(k\) in expanders

This page was built for publication: Expanders – how to find them, and what to find in them