Submodular partition functions

Adapting the method introduced in Graph Minors X, we propose a new proof of the duality between the bramble number of a graph and its tree-width. Our approach is based on a new definition of submodularity on partition functions which naturally extends the usual one on set functions. The proof does not rely on Menger's theorem, and thus generalises the original one. It thus provides a dual for matroid tree-width. One can also derive all known dual notions of other classical width-parameters from it.

[1]  Robin Thomas,et al.  Graph Searching and a Min-Max Theorem for Tree-Width , 1993, J. Comb. Theory, Ser. B.

[2]  Paul D. Seymour,et al.  Testing branch-width , 2007, J. Comb. Theory, Ser. B.

[3]  B. Reed.  Surveys in Combinatorics, 1997: Tree Width and Tangles: A New Connectivity Measure and Some Applications , 1997 .

[4]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[5]  P. Seymour,et al.  Graphs of bounded rank-width , 2005 .

[6]  Paul D. Seymour,et al.  Graph minors. X. Obstructions to tree-decomposition , 1991, J. Comb. Theory, Ser. B.

[7]  Paul D. Seymour,et al.  Graph minors. I. Excluding a forest , 1983, J. Comb. Theory, Ser. B.

[8]  Bert Gerards,et al.  Branch-Width and Well-Quasi-Ordering in Matroids and Graphs , 2002, J. Comb. Theory, Ser. B.

[9]  Geoff Whittle,et al.  Matroid tree-width , 2006, Eur. J. Comb..

[10]  Paul D. Seymour,et al.  Approximating clique-width and branch-width , 2006, J. Comb. Theory B.

[11]  Robin Thomas,et al.  Quickly excluding a forest , 1991, J. Comb. Theory, Ser. B.

[12]  Dimitrios M. Thilikos,et al.  On the monotonicity of games generated by symmetric submodular functions , 2003, Discret. Appl. Math..

[13]  B. Mohar,et al.  Graph Minors , 2009 .