In the mid 1900s the area of extremal graph theory took its first propersteps with the proof of Turán’s theorem. In 1963 Pál Erdős asked for an extension of this fundamental result regarding (n, s, q)-graphs; graphs on n vertices in which any s-set of vertices spans at most q edges, and multiple edges are allowed; and raised the question of determining ex(n, s, q), the maximum number of edges spanning such a graph. More recently, Mubayi and Terry looked at the problem of determining the maximum productof the edges in (n, s, q)-graphs. Their proof was further investigated by Day, Falgas-Ravry and Treglown who, in particular, settled a conjecture of Mubayi and Terry regarding the case (s, q) = (4, 6a+3), for a ∈ Z≥2. In this thesis we look at the case (s, q) = (5, 24), which is mentioned as an open problem at the end of the paper by Day, Falgas-Ravry and Treglown. A hypothetical extremal construction was provided by Victor Falgas-Ravry, and we prove it to be asymptotically optimal.
Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:umu-198891 |
Date | January 2022 |
Creators | Persson Eriksson, William |
Publisher | Umeå universitet, Institutionen för matematik och matematisk statistik |
Source Sets | DiVA Archive at Upsalla University |
Language | English |
Detected Language | English |
Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
Format | application/pdf |
Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0025 seconds