Extremal Combinatorics, Probabilistic Combinatorics
Lead Research Organisation:
University of Birmingham
Department Name: School of Mathematics
Abstract
My PhD is at the interface of Graph Minors, Connectivity and Matroids. Recently, the simply connected 2-complexes embeddable in 3-space have been characterised - in a way similar to Kuratowski's characterisation of graph planarity. In other words, there has been found a forbidden minor characterisation of simply connected 2-complexes embeddable in 3-space. In my PhD, I want to investigate this further. This includes applying these techniques, and developing them even further. This work is connected to an ESPRC grant called 'Graph Minors in 3D and connectivity'.
Organisations
People |
ORCID iD |
Tsvetomir Mihaylov (Student) |
Studentship Projects
Project Reference | Relationship | Related To | Start | End | Student Name |
---|---|---|---|---|---|
EP/N509590/1 | 01/10/2016 | 30/09/2021 | |||
2281342 | Studentship | EP/N509590/1 | 30/09/2019 | 29/03/2023 | Tsvetomir Mihaylov |
EP/R513167/1 | 01/10/2018 | 30/09/2023 | |||
2281342 | Studentship | EP/R513167/1 | 30/09/2019 | 29/03/2023 | Tsvetomir Mihaylov |