About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Combinatorica
Paper
Recursive construction for 3-regular expanders
Abstract
We present an algorithm which in n3 (log n)3 time constructs a 3-regular expander graph on n vertices. In each step we substitute a pair of edges of the graph by a new pair of edges so that the total number of cycles of length s=⌊clog n⌋ decreases (for some fixed absolute constant c). When we reach a local minimum in the number of cycles of length s the graph is an expander. © 1994 Akadémiai Kiadó.