Tree-width of hypergraphs and surface dualityReport as inadecuate

Tree-width of hypergraphs and surface duality - Download this document for free, or read online. Document in PDF available to download.

* Corresponding author 1 LaBRI - Laboratoire Bordelais de Recherche en Informatique

Abstract : In Graph Minor III, Robertson and Seymour conjecture that the tree-width of a planar graph and that of its dual differ by at most one. We prove that given a hypergraph H on a surface of Euler genus k, the tree-width of H^∗ is at most the maximum of twH + 1 + k and the maximum size of a hyperedge of H^∗ .

Keywords : tree-width duality surface

Author: Frédéric Mazoit -



Related documents