- Series
- Graph Theory Seminar
- Time
- Thursday, March 28, 2019 - 3:00pm for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Fan Wei – Stanford University
- Organizer
- Xingxing Yu
Reed
and Wood and independently Norine, Seymour, Thomas, and Wollan showed
that for each $t$ there is $c(t)$ such that every graph on $n$ vertices
with no $K_t$ minor has
at most $c(t)n$ cliques. Wood asked in 2007 if
$c(t)