@inbook{aabaab574e144bea817216a4e7c4be3c,
title = "On constructing expanders for any number of vertices",
abstract = "While typical constructions of explicit expanders work for certain sizes (i.e., number of vertices), one can obtain constructions of about the same complexity by manipulating the original expanders. One way of doing so is detailed and analyzed below. For any mε[0.5n,n] (equiv., nε[m,2m]), given an m-vertex expander, Gm, we construct an n-vertex expander by connecting each of the first n-m vertices of Gm to an (otherwise isolated) new vertex, and adding edges arbitrarily to regain regularity. Our analysis of this construction uses the combinatorial definition of expansion.",
author = "Oded Goldreich",
note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2020.",
year = "2020",
month = apr,
day = "4",
doi = "10.1007/978-3-030-43662-9\_21",
language = "الإنجليزيّة",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "374--379",
editor = "Oded Goldreich",
booktitle = "Computational Complexity and Property Testing",
address = "ألمانيا",
}