Small minors and subdivisions

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

• Richard Montgomery (University of Cambridge)
• Thursday 30 May 2013, 14:30-15:30
• MR12.

If you have a question about this talk, please contact Andrew Thomason.

There is a function c(t) such that any graph of order n with c(t)n edges has a Kt minor. Improving on work of Fiorini-Joret-Theis-Wood and of Shapira-Sudakov, we show that if the graph has (c(t)+epsilon)n edges then it has a minor of order O(log n). A similar result holds for subdivisions.

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Combinatorics Seminar
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR12
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.