Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4654849 | European Journal of Combinatorics | 2007 | 15 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Isolde Adler, Georg Gottlob, Martin Grohe,