The University of Michigan Student Combinatorics Seminar
|
|---|
|
Abstract |
|---|
Expander graphs are graphs with few edges and strong connectivity properties that have applications throughout computer science. I will prove some basic useful properties of expander graphs, discuss a few applications in complexity theory and error correcting codes, and, time permitting, go over some recent constructions of expander graphs.
|