Geodesic
Weak Positional Games on Hypergraphs of Rank Three
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) (2005).

Voir la notice de l'article provenant de la source Episciences

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. 
@article{DMTCS_2005_special_250_a31,
     author = {Kutz, Martin},
     title = {Weak {Positional} {Games} on {Hypergraphs} of {Rank} {Three}},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)},
     year = {2005},
     doi = {10.46298/dmtcs.3422},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3422/}
}
TY  - JOUR
AU  - Kutz, Martin
TI  - Weak Positional Games on Hypergraphs of Rank Three
JO  - Discrete mathematics & theoretical computer science
PY  - 2005
VL  - DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3422/
DO  - 10.46298/dmtcs.3422
LA  - en
ID  - DMTCS_2005_special_250_a31
ER  - 
%0 Journal Article
%A Kutz, Martin
%T Weak Positional Games on Hypergraphs of Rank Three
%J Discrete mathematics & theoretical computer science
%D 2005
%V DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3422/
%R 10.46298/dmtcs.3422
%G en
%F DMTCS_2005_special_250_a31
Kutz, Martin. Weak Positional Games on Hypergraphs of Rank Three. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) (2005). doi : 10.46298/dmtcs.3422. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3422/

Cité par Sources :