School Seminars and Colloquia

Small Graph Minors

Discrete Structures and Algorithms (Seminar)

by David Wood


Institution: The University of Melbourne
Date: Tue 13th September 2011
Time: 11:00 AM
Location: Russell Love Theatre, Richard Berry Building

Abstract: A fundamental result in structural graph theory states that every graph with large average degree contains a large complete graph as a minor. We prove this result with the extra property that the minor is "small" with respect to the order of the whole graph. Other related results will be explored. Joint work with Samuel Fiorini, Gwenael Joret, and Dirk Theis.