Hypertree-Width and Related Hypergraph Invariants
Résumé
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.
| Origine | Fichiers éditeurs autorisés sur une archive ouverte |
|---|
Loading...