Skip navigation
Please use this identifier to cite or link to this item: http://arks.princeton.edu/ark:/88435/dsp01db78tf87q
Title: A survey of expansion in combinatorial graphs
Authors: Chan, Jonathan
Advisors: Dvir, Zeev
Department: Mathematics
Class Year: 2019
Abstract: We provide an expository overview of graph expansion, focusing on graph properties associated with expansion, the abundance of expander graphs, extremal bounds on graph expansion, and some recent results on the existence of expander families in certain restricted classes of graphs.
URI: http://arks.princeton.edu/ark:/88435/dsp01db78tf87q
Type of Material: Princeton University Senior Theses
Language: en
Appears in Collections:Mathematics, 1934-2023

Files in This Item:
File Description SizeFormat 
CHAN-JONATHAN-THESIS.pdf389.05 kBAdobe PDF    Request a copy


Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.