Weak Positional Games on Hypergraphs of Rank Three

Kutz, Martin; Felsner, Stefan

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

前へ次へ / 131

公開

会議論文

Weak Positional Games on Hypergraphs of Rank Three

MPS-Authors

/persons/resource/persons44874

Kutz, Martin
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Kutz, M. (2005). Weak Positional Games on Hypergraphs of Rank Three. In 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) (pp. 31-36). Nancy, France: DMTCS.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-283E-2

要旨

In a weak positional game, two players, Maker and Breaker, alternately claim vertices of a hypergraph until either Maker wins by getting a complete edge or all vertices are taken without this happening, a Breaker win. For the class of almost-disjoint hypergraphs of rank three (edges with up to three vertices only and edge-intersections on at most one vertex) we show how to find optimal strategies in polynomial time. Our result is based on a new type of decomposition theorem which might lead to a better understanding of weak positional games in general.