Tree-width of hypergraphs and surface duality

Details Tree-width of hypergraphs and surface duality Tree-width of hypergraphs and surface duality

2010-06-16

arxiv.org/abs/1006.3167v2

Computer Science

Discrete Mathematics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Tree-width of hypergraphs and surface duality does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Tree-width of hypergraphs and surface duality, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tree-width of hypergraphs and surface duality will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-100279