UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

The Erdős Pentagon Problem

Thumbnail Image

Files

Siy_Kris.pdf (540.94 KB)

Date

2018-12-20

Authors

Siy, Kris

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

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.

Description

Keywords

graph theory, extremal graph theory, pentagon problem, flag algebras

LC Keywords

Citation

URI

http://hdl.handle.net/10012/14274

Collections

Theses
Combinatorics and Optimization