Basic Problems in Extremal Graph Theory
Lead Research Organisation:
University of Cambridge
Department Name: Pure Maths and Mathematical Statistics
Abstract
Extremal problems are at the heart of classical graph theory. Although hundreds of papers have been written in the area, some of the basic problems are still unsolved. I was very surprised that a short while ago one of the notorious questions was answered: every K4-free
graph with n vertices and bn2=4c + m edges contains m edge-disjoint triangles. Still, this beautiful result is not the last word on the topic: I hope that Jan can improve this result considerably before going on to some related problems.
graph with n vertices and bn2=4c + m edges contains m edge-disjoint triangles. Still, this beautiful result is not the last word on the topic: I hope that Jan can improve this result considerably before going on to some related problems.
Organisations
People |
ORCID iD |
| Bela Bollobas (Primary Supervisor) | |
| Jan Petr (Student) |
Studentship Projects
| Project Reference | Relationship | Related To | Start | End | Student Name |
|---|---|---|---|---|---|
| EP/V52024X/1 | 01/10/2020 | 31/10/2025 | |||
| 2604195 | Studentship | EP/V52024X/1 | 01/10/2021 | 31/12/2024 | Jan Petr |