论文信息 - A lower bound on the tree-width of graphs with irrelevant vertices

A lower bound on the tree-width of graphs with irrelevant vertices

For their famous algorithm for the disjoint paths problem, Robertson and Seymour proved that there is a function $f$ such that if the tree-width of a graph $G$ with $k$ pairs of terminals is at least $f(k)$, then $G$ contains a solution-irrelevant vertex (Graph Minors. XXII., JCTB 2012). We give a single-exponential lower bound on $f$. This bound even holds for planar graphs.

Philipp Klaus Krause | Isolde Adler | Isolde Adler | P. K. Krause

[1] Paul D. Seymour,et al. Graph minors. XXI. Graphs with unique linkages , 2009, J. Comb. Theory, Ser. B.

[2] Carsten Thomassen,et al. Graphs on Surfaces , 2001, Johns Hopkins series in the mathematical sciences.

[3] Paul D. Seymour,et al. Graph Minors. XXII. Irrelevant vertices in linkage problems , 2012, J. Comb. Theory, Ser. B.

[4] Dimitrios M. Thilikos,et al. Tight Bounds for Linkages in Planar Graphs , 2011, ICALP.

[5] H. Whitney. Congruent Graphs and the Connectivity of Graphs , 1932 .

[6] Tony Huynh,et al. Explicit bounds for graph minors , 2018, J. Comb. Theory, Ser. B.

[7] Neil Robertson,et al. Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.

[8] Frédéric Mazoit. A single exponential bound for the redundant vertex Theorem on surfaces , 2013, 1309.7820.

[9] Jirí Matousek,et al. Untangling Two Systems of Noncrossing Curves , 2013, Graph Drawing.

[10] K. Menger. Zur allgemeinen Kurventheorie , 1927 .

[11] Richard M. Karp,et al. On the Computational Complexity of Combinatorial Problems , 1975, Networks.

[12] Dimitrios M. Thilikos,et al. Irrelevant vertices for the planar Disjoint Paths Problem , 2013, J. Comb. Theory, Ser. B.

[13] Philipp Klaus Krause,et al. Graph decomposition in routing and compilers , 2016 .

[14] James F. Lynch,et al. The equivalence of theorem proving and the interconnection problem , 1975, SIGD.