Applications of convex optimization in extremal graph theory

Add to your list(s) Download to your calendar using vCal

• Will Perkins (School of Mathematics)
• Thursday 01 February 2018, 12:00-13:00
• Lecture Theatre 2, Strathcona Building.

If you have a question about this talk, please contact Sergey Sergeev.

Extremal graph theory deals with problems of maximizing and minimizing graph parameters over given classes of finite graphs. For instance, what d-regular graph on n vertices has the most matchings? Or what cubic graph on n vertices has the most proper 5-colorings? I will describe how such extremal problems can be solved using techniques from convex optimization. In particular, I will describe a new method for solving extremal problems on bounded degree graphs using probabilistic models from statistical physics and linear programming relaxations. The talk will be aimed at an audience familiar with linear programming but with little or no background in graph theory and statistical physics.

This talk is part of the Optimisation and Numerical Analysis Seminars series.

This talk is included in these lists:

• Lecture Theatre 2, Strathcona Building
• Optimisation and Numerical Analysis Seminars
• School of Mathematics events

Note that ex-directory lists are not shown.