On 03.05.2007 at 13:00 in S5, there is the following noon lecture:
On tree width, bramble size, and expansion
The notion of brambles gives a dual characterization of tree width: Seymour and Thomas proved that a graph has a tree decomposition of width k if and only if every bramble has order at most k+1. In this talk we investigate this notion and examine what happens if we would like to have brambles of polynomial size. We are able to show that every graph has a polynomial-size bramble whose order is roughly the square root of the tree width of the graph, but there are graphs where every bramble with order larger than the square root of the tree width has to be of exponential size.
Webmaster: kamweb.mff.cuni.cz Modified: 25. 02. 2019