Tree-width of hypergraphs and surface duality

Frédéric Mazoit (1, 2)

1 LIP - Laboratoire de l'Informatique du Parallélisme
2 LaBRI - Laboratoire Bordelais de Recherche en Informatique

In Graph Minor III, Robertson and Seymour conjecture that the difference between the tree-width of a planar graph and that of its dual is 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 tw(H) + 1 + k and the maximum size of a hyperedge of H∗.

Mots clés: tree-width; surface duality; hypergraphs

Domaines: Mathématique discrète [cs.DM]

Frédéric Mazoit. Tree-width of hypergraphs and surface duality. DIMAP Workshop on Algorithmic Graph Theory, Mar 2009, France. pp.93-97, ⟨10.1016/j.endm.2009.02.013⟩. ⟨hal-00380502⟩