Fetching the paper…
Reading the bibliography…
We construct an infinite family of bounded-degree bipartite unique-neighbour expander graphs with arbitrarily unbalanced sides.
“Superconcentrators”
Nicholas Pippenger · 1977
Earlier work this paper cites.
“A recursive approach to low complexity codes”
R Tanner · 1981
Earlier work this paper cites.
“Walk generating functions and spectral measures of infinite graphs”
Chris Godsil and Bojan Mohar · 1988
Earlier work this paper cites.
“Ramanujan graphs”
Alexander Lubotzky, Ralph Phillips and Peter Sarnak · 1988
Earlier work this paper cites.
“Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators”
G.. Margulis · 1988
Earlier work this paper cites.
“The token distribution problem”
David Peleg and Eli Upfal · 1989
Earlier work this paper cites.
“On the second eigenvalue of a graph”
Alon Nilli · 1991
Earlier work this paper cites.
“Self-routing superconcentrators”
Nicholas Pippenger · 1993
Earlier work this paper cites.
“Interlacing eigenvalues and graphs”
Willem Haemers · 1995
Earlier work this paper cites.
“Eigenvalues and expansion of regular graphs”
Nabil Kahale · 1995
Cited alongside, same era.
“On-line algorithms for path selection in a nonblocking network”
Sanjeev Arora, Frank Leighton and Bruce Maggs · 1996
Cited alongside, same era.
“Spectra of hypergraphs and applications”
Keqin Feng and Wen-Ch’ing Li · 1996
Cited alongside, same era.
“Spectra of Regular Graphs and Hypergraphs and Orthogonal Polynomials”
Wen-Ch’ing Li and Patrick Solé · 1996
Cited alongside, same era.
“Expander codes”
Michael Sipser and Daniel Spielman · 1996
Cited alongside, same era.
“Explicit unique-neighbor expanders”
Noga Alon and Michael Capalbo · 2002
Cited alongside, same era.
“Pseudorandomness”
Salil Vadhan · 2012
Later among the works it cites.
“Interlacing families I: Bipartite Ramanujan graphs of all degrees”
Adam Marcus, Daniel Spielman and Nikhil Srivastava · 2013
Later among the works it cites.
“Explicit construction of Ramanujan bigraphs”
Cristina Ballantine, Brooke Feigon, Radhika Ganapathy, Janne Kool, Kathrin Maurischat and Amy Wooding · 2015
Later among the works it cites.
“Symmetric unique neighbor expanders and good LDPC codes”
Oren Becker · 2016
Later among the works it cites.
“Sampling graphs without forbidden subgraphs and unbalanced expanders with negligible error”
Benny Applebaum and Eliran Kachlon · 2019
Later among the works it cites.
“ L p L^{p} Expander Graphs”, 2019
Amitay Kamber · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Michael Capalbo, Omer Reingold, Salil Vadhan and Avi Wigderson · 2002
Cited alongside, same era.
“Robust local testability of tensor products of LDPC codes”
Irit Dinur, Madhu Sudan and Avi Wigderson · 2006
Cited alongside, same era.
“Tensor products of weakly smooth codes are robust”
Eli Ben-Sasson and Michael Viderman · 2009
Cited alongside, same era.
Later among the works it cites.
“Existence and polynomial time construction of biregular, bipartite Ramanujan graphs of all degrees”
Aurelien Gribinski and Adam Marcus · 2021
Later among the works it cites.
“Spectral gap in random bipartite biregular graphs and applications”
Gerandy Brito, Ioana Dumitriu and Kameron Harris · 2022
Later among the works it cites.
“Combinatorics via closed orbits: number theoretic Ramanujan graphs are not unique neighbor expanders”
Amitay Kamber and Tali Kaufman · 2022
Later among the works it cites.