Applications accepted all year round
Competition Funded PhD Project (UK Students Only)
About the Project
Extremal graph theory is one of the most active and dynamic branches of combinatorics. The fundamental goal of the area is to understand what conditions force a graph to contain some substructure. For example, Mantel’s theorem – proved more than a century ago – determines how many edges a graph on n vertices needs to guarantee it contains a triangle. In recent years, a number of powerful methods have been developed allowing researchers to answer long-standing questions in extremal graph theory.…
Esta es una lista previa...
Usted debe registrarse para ver la descripción completa del trabajo, y para aplicar.
Gestionar / actualizar este trabajo a una lista completa de empleo.
Encuentra tu mejor oportunidad
Cuéntanos AcademicJobs.com ¡Te ha enviado!
