| dc.rights.license | CC-BY-NC-ND | |
| dc.contributor.advisor | Müller, T. | |
| dc.contributor.author | Widdershoven, C. | |
| dc.date.accessioned | 2016-09-01T17:00:34Z | |
| dc.date.available | 2016-09-01T17:00:34Z | |
| dc.date.issued | 2016 | |
| dc.identifier.uri | https://studenttheses.uu.nl/handle/20.500.12932/23972 | |
| dc.description.abstract | The Erdős-Stone-Simonovits theorems say that any graph F can be embedded in
any graph G when G has a sufficient amount of vertices and edges. We will discuss
some extremal problems and look at the Turán numbers of triangles, quadrilater-
als and some other graphs leading up to the proof of the Erdős-Stone-Simonovits
theorems. | |
| dc.description.sponsorship | Utrecht University | |
| dc.format.extent | 246549 | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en | |
| dc.title | Extremal graphs and the Erdős-Stone-Simonovits theorems | |
| dc.type.content | Bachelor Thesis | |
| dc.rights.accessrights | Open Access | |
| dc.subject.keywords | extremal graph; Erdős-Stone-Simonovits; Erdős-Stone; graph theory | |
| dc.subject.courseuu | Wiskunde | |
