Tree-width of hypergraphs and surface duality
Discrete Mathematics
2011-12-02 v2
Abstract
In Graph Minors III, Robertson and Seymour write: "It seems that the tree-width of a planar graph and the tree-width of its geometric dual are approximately equal - indeed, we have convinced ourselves that they differ by at most one". They never gave a proof of this. In this paper, we prove a generalisation of this statement to embedding of hypergraphs on general surfaces, and we prove that our bound is tight.
Keywords
Cite
@article{arxiv.1006.3167,
title = {Tree-width of hypergraphs and surface duality},
author = {Frédéric Mazoit},
journal= {arXiv preprint arXiv:1006.3167},
year = {2011}
}