University of Cambridge > Talks.cam > Combinatorics Seminar > Small minors and subdivisions

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Small minors and subdivisions

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Ground Floor Lecture Theatre, Department of Experimental Psychology Average on weekdays: 8974.26838235 kWh Hybrid: Centre for Family Research, Cockcroft Building, 4th Floor / Zoom: link available from lg648

Other talks

The Imagined Conflict: On Science and God Title to be confirmed Differences between Robin and Neumann eigenvalues Title TBC Teams Announced Group Presentation 4
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity