@inbook{67c628ef861d4f228b13dbe7f9ca6e49,

title = "Expanders - how to find them, and what to find in them",

abstract = "A graph $G=(V, E)$ is called an expander if every vertex subset U of size up to $|V|/2$ has an external neighborhood whose size is comparable to $|U|$. Expanders have been a subject of intensive research for more than three decades and have become one of the central notions of modern graph theory. We first discuss the above definition of an expander and its alternatives. Then we present examples of families of expanding graphs and state basic properties of expanders. Next, we introduce a way to argue that a given graph contains a large expanding subgraph. Finally we research properties of expanding graphs, such as existence of small separators, of cycles (including cycle lengths), and embedding of large minors.",

keywords = "Cycles, Expanding graphs, Graph minors, Paths",

author = "Michael Krivelevich",

note = "Publisher Copyright: {\textcopyright} Cambridge University Press 2019.",

year = "2019",

month = jan,

day = "1",

doi = "10.1017/9781108649094.005",

language = "אנגלית",

isbn = "9781108740722",

series = "London Mathematical Society Lecture Note Series ",

publisher = "Cambridge University Press",

pages = "115--142",

editor = "Lo, {Allan } and Mycroft, {Richard } and Perarnau, {Guillem } and Treglown, {Andrew }",

booktitle = "Surveys in Combinatorics 2019",

address = "בריטניה",

}