The Erdős Pentagon Problem
| dc.contributor.author | Siy, Kris | |
| dc.date.accessioned | 2018-12-20T15:43:22Z | |
| dc.date.available | 2018-12-20T15:43:22Z | |
| dc.date.issued | 2018-12-20 | |
| dc.date.submitted | 2018 | |
| dc.description.abstract | The Erdős pentagon problem asks about the maximum number of copies of C_5 that one can find in a triangle-free graph. This problem was posed in 1984, but was not resolved until 2012. In this thesis, we aim to capture the story of solving the pentagon problem as completely as possible. We provide a detailed exposition of the motivation behind and construction of flag algebras, and give a complete solution to the pentagon problem using flag algebra techniques. All known solutions of the pentagon problem to date have been computer-assisted; with the question of whether an elementary solution can be found in mind, we also investigate the pentagon problem and modifications of the problem from different elementary perspectives. | en |
| dc.identifier.uri | http://hdl.handle.net/10012/14274 | |
| dc.language.iso | en | en |
| dc.pending | false | |
| dc.publisher | University of Waterloo | en |
| dc.subject | graph theory | en |
| dc.subject | extremal graph theory | en |
| dc.subject | pentagon problem | en |
| dc.subject | flag algebras | en |
| dc.title | The Erdős Pentagon Problem | en |
| dc.type | Master Thesis | en |
| uws-etd.degree | Master of Mathematics | en |
| uws-etd.degree.department | Combinatorics and Optimization | en |
| uws-etd.degree.discipline | Combinatorics and Optimization | en |
| uws-etd.degree.grantor | University of Waterloo | en |
| uws.contributor.advisor | Haxell, Penny | |
| uws.contributor.affiliation1 | Faculty of Mathematics | en |
| uws.peerReviewStatus | Unreviewed | en |
| uws.published.city | Waterloo | en |
| uws.published.country | Canada | en |
| uws.published.province | Ontario | en |
| uws.scholarLevel | Graduate | en |
| uws.typeOfResource | Text | en |