Hypertree width and related hypergraph invariants

We study the notion of hypertree width of hypergraphs. We prove that, up to a constant factor, hypertree width is the same as a number of other hypergraph invariants that resemble graph invariants such as bramble number, branch width, linkedness, and the minimum number of cops required to win Seymour and Thomas’s robber and cops game.

• Type: Journal
• Year: 2007
• Where: EJC
• Authors: Isolde Adler, Georg Gottlob, Martin Grohe
• Keywords: Constant Factor, EJC 2007, Graph Invariants, Hypertree Width, Information Technology