Please use this identifier to cite or link to this item:
http://arks.princeton.edu/ark:/88435/dsp01db78tf87qFull metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Dvir, Zeev | - |
| dc.contributor.author | Chan, Jonathan | - |
| dc.date.accessioned | 2019-07-25T18:31:19Z | - |
| dc.date.available | 2019-07-25T18:31:19Z | - |
| dc.date.created | 2019-05-06 | - |
| dc.date.issued | 2019-07-25 | - |
| dc.identifier.uri | http://arks.princeton.edu/ark:/88435/dsp01db78tf87q | - |
| dc.description.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. | en_US |
| dc.format.mimetype | application/pdf | - |
| dc.language.iso | en | en_US |
| dc.title | A survey of expansion in combinatorial graphs | en_US |
| dc.type | Princeton University Senior Theses | - |
| pu.date.classyear | 2019 | en_US |
| pu.department | Mathematics | en_US |
| pu.pdf.coverpage | SeniorThesisCoverPage | - |
| pu.contributor.authorid | 961154045 | - |
| Appears in Collections: | Mathematics, 1934-2023 | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| CHAN-JONATHAN-THESIS.pdf | 389.05 kB | Adobe PDF | Request a copy |
Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.