Show simple item record

dc.contributor.authorSiy, Kris
dc.date.accessioned2018-12-20 15:43:22 (GMT)
dc.date.available2018-12-20 15:43:22 (GMT)
dc.date.issued2018-12-20
dc.date.submitted2018
dc.identifier.urihttp://hdl.handle.net/10012/14274
dc.description.abstractThe 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.language.isoenen
dc.publisherUniversity of Waterlooen
dc.subjectgraph theoryen
dc.subjectextremal graph theoryen
dc.subjectpentagon problemen
dc.subjectflag algebrasen
dc.titleThe Erdős Pentagon Problemen
dc.typeMaster Thesisen
dc.pendingfalse
uws-etd.degree.departmentCombinatorics and Optimizationen
uws-etd.degree.disciplineCombinatorics and Optimizationen
uws-etd.degree.grantorUniversity of Waterlooen
uws-etd.degreeMaster of Mathematicsen
uws.contributor.advisorHaxell, Penny
uws.contributor.affiliation1Faculty of Mathematicsen
uws.published.cityWaterlooen
uws.published.countryCanadaen
uws.published.provinceOntarioen
uws.typeOfResourceTexten
uws.peerReviewStatusUnrevieweden
uws.scholarLevelGraduateen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record


UWSpace

University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages