by Andrew Thomason
Abstract:
Given a graph 
, let 
be the smallest constant 
such that every
graph 
with 
edges contains as a minor. We give an upper bound
(due to Wales+T) on , depending only on the number of vertices in
and its average degree, such that (due to Norin+Reed+T+Wood) the bound is
tight for almost all with these parameters.
Event Timeslots (1)
Tuesday
-
Andrew Thomason