Title of article
Hypertree width and related hypergraph invariants
Author/Authors
Adler، نويسنده , , Isolde and Gottlob، نويسنده , , Georg and Grohe، نويسنده , , Martin، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
15
From page
2167
To page
2181
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.
Journal title
European Journal of Combinatorics
Serial Year
2007
Journal title
European Journal of Combinatorics
Record number
1550760
Link To Document