Tree-width of hypergraphs and surface duality

Simple item page
dc.creatorMazoit, Frédéric
dc.date2008-12-16
dc.date.accessioned2026-07-07T12:13:03Z
dc.date.available2026-07-07T12:13:03Z
dc.descriptionIn 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 tw(H) + 1 + k and the maximum size of a hyperedge of H^*.
dc.identifierhttps://arxiv.org/abs/0812.2990
dc.identifierhttp://arxiv.org/abs/0812.2990
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/210746
dc.subjectDiscrete Mathematics
dc.titleTree-width of hypergraphs and surface duality
dc.typetext

Files

Collections

arXiv