University of Cambridge > > Combinatorics Seminar > Small minors and subdivisions

Small minors and subdivisions

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

  • UserRichard Montgomery (University of Cambridge)
  • ClockThursday 30 May 2013, 14:30-15:30
  • HouseMR12.

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity