Michelle Delcourt (University of Illinois): Finding a highly connected, spanning, bipartite subgraph |
|
|
|
Csütörtök, 2. Július 2015, 11:00 - 13:00
|
|
Abstract. In 1989, Thomassen asked whether there is an integer-valued function f(k) such that every f(k)-connected graph admits a spanning, bipartite k-connected subgraph. In this talk we show that the conjecture is true up to a log n factor. This is joint work with Asaf Ferber. |
Vissza
JEvents v3.1.8 Stable
Copyright © 2006-2013