The extremal number of subdivisions

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

• Oliver Janzer (University of Cambridge)
• Thursday 10 October 2019, 14:00-15:00
• Watson LTB.

If you have a question about this talk, please contact Eoin Long.

For a graph H, the extremal number ex(n,H) is defined to be the maximal number of edges in an H-free graph on n vertices. For bipartite graphs H, determining the order of magnitude of ex(n,H) is notoriously difficult. In this talk I present recent progress on this problem.

The k-subdivision of a graph F is obtained by replacing the edges of F with internally vertex-disjoint paths of length k+1. Most of our results concern the extremal number of various subdivided graphs, especially the subdivisions of the complete graph and the complete bipartite graph.

Partially joint work with David Conlon and Joonkyung Lee.

This talk is part of the Combinatorics and Probability Seminar series.

This talk is included in these lists:

• Combinatorics and Probability Seminar
• School of Mathematics Events
• Watson LTB

Note that ex-directory lists are not shown.