Editing Expander graph (section)

===Research articles===
* {{Citation|last1=Ajtai|first1=M.|author1-link=Miklós Ajtai|last2=Komlós|first2=J.|author2-link=János Komlós (mathematician)|last3=Szemerédi|first3=E.|author3-link=Endre Szemerédi|chapter=An O(n log n) sorting network|title=Proceedings of the 15th Annual ACM Symposium on Theory of Computing|pages=1–9|year=1983|doi=10.1145/800061.808726|isbn=978-0-89791-099-6|s2cid=15311122}}
* {{Citation
 | first1=M. | last1=Ajtai
 | first2=J. | last2=Komlós
 | first3=E. | last3=Szemerédi
 | chapter=Deterministic simulation in LOGSPACE
 | title=Proceedings of the 19th Annual ACM Symposium on Theory of Computing
 | pages=132–140
 | year=1987
 | publisher=ACM
 | doi=10.1145/28395.28410
 | isbn=978-0-89791-221-1
| s2cid=15323404
 | doi-access=free
 }}
* {{Citation | last1 = Alon | first1 = N. | last2 = Capalbo | first2 = M. | doi = 10.1109/SFCS.2002.1181884 | chapter = Explicit unique-neighbor expanders | title = The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings | page = 73 | year = 2002 | isbn = 978-0-7695-1822-0 | citeseerx = 10.1.1.103.967 | s2cid = 6364755 }}
* {{Citation
    |last1=Bobkov|first1=S.
    |last2=Houdré|first2=C.
    |last3=Tetali|first3=P. | author3-link= Prasad V. Tetali
    |title=λ<sub>∞</sub>, vertex isoperimetry and concentration|journal=Combinatorica|volume=20|issue=2|year=2000|doi=10.1007/s004930070018|pages = 153–172|s2cid=1173532
 }}.
* {{Citation|last=Dinur|first=Irit|title=The PCP theorem by gap amplification|journal=Journal of the ACM|volume=54|issue=3|year=2007|doi=10.1145/1236457.1236459|pages=12–es|url=http://www.cs.huji.ac.il/~dinuri/mypapers/combpcp.pdf|citeseerx=10.1.1.103.2644|s2cid=53244523}}.
* {{Citation|last=Dodziuk|author-link=Jozef Dodziuk|first=Jozef|title=Difference equations, isoperimetric inequality and transience of certain random walks|journal=Trans. Amer. Math. Soc.|volume=284|issue=2|year=1984|doi=10.2307/1999107|pages=787–794|jstor=1999107|doi-access=free}}.
* {{Citation
 | first=D. | last=Gillman
 | title=A Chernoff Bound for Random Walks on Expander Graphs
 | journal=SIAM Journal on Computing
 | volume=27
 | issue=4
 | pages=1203–1220
 | year=1998
 | doi=10.1137/S0097539794268765
}}
* {{Citation
 | first=Oded
 | last=Goldreich
 | title=Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation
 |chapter=Basic Facts about Expander Graphs
 |date= 2011
 | pages     = 451–464
 | doi        = 10.1007/978-3-642-22670-0_30
| url=http://www.wisdom.weizmann.ac.il/%7Eoded/COL/expander.pdf
 | series=Lecture Notes in Computer Science (Vol. 6650)
 | volume=6650
 | isbn=978-3-642-22669-4
 | citeseerx=10.1.1.231.1388
 }}
* {{Citation|first=Omer|last=Reingold|author-link=Omer Reingold|title=Undirected connectivity in log-space|journal=[[Journal of the ACM]]|year=2008|
volume=55|issue=4|pages=1–24|doi=10.1145/1391289.1391291
|s2cid=207168478}}
* {{Citation
|first=Amir
|last=Yehudayoff
|title=Proving expansion in three steps
|journal=[[ACM SIGACT News]]
|year=2012
|volume=43
|issue=3
|pages=67–84
|doi=10.1145/2421096.2421115
|s2cid=18098370
}}