Optimizing the Graph Minors Weak Structure Theorem - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles SIAM Journal on Discrete Mathematics Year : 2013

Optimizing the Graph Minors Weak Structure Theorem


One of the major results of [N. Robertson and P. D. Seymour, Graph minors. XIII. The disjoint paths problem, J. Combin. Theory Ser. B, 63 (1995), pp. 65--110], also known as the weak structure theorem, reveals the local structure of graphs excluding some graph as a minor: each such graph $G$ either has small treewidth or contains the subdivision of a planar graph (a wall) that can be arranged in a flat manner inside $G$, given that some small set of vertices is removed. We prove an optimized version of that theorem where (i) the relation between the treewidth of the graph and the height of the wall is linear (thus best possible) and (ii) the number of vertices to be removed is minimized.


Dates and versions

lirmm-00904527 , version 1 (14-11-2013)



Archontia C. Giannopoulou, Dimitrios M. Thilikos. Optimizing the Graph Minors Weak Structure Theorem. SIAM Journal on Discrete Mathematics, 2013, 27 (3), pp.1209-1227. ⟨10.1137/110857027⟩. ⟨lirmm-00904527⟩
135 View
0 Download



Gmail Facebook Twitter LinkedIn More