Now showing items 1-1 of 1
The Erdős Pentagon Problem
(University of Waterloo, 2018-12-20)
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 ...