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.…
This is a Preview Listing…
You must sign in to see the full job description, and to apply.
Manage / Upgrade this job to a Full Job Listing.
Find Your Best Opportunity
Tell them AcademicJobs.com sent you!
