Premium
SHUTOUT GAMES ON GRAPHS
Author(s) -
Cioba Alexandru,
Savvas Michail
Publication year - 2015
Publication title -
mathematika
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.955
H-Index - 29
eISSN - 2041-7942
pISSN - 0025-5793
DOI - 10.1112/s0025579314000382
Subject(s) - mathematics , vertex (graph theory) , combinatorics , graph , enhanced data rates for gsm evolution , computer science , artificial intelligence
Two players take it in turn to claim edges from a graph G . The first player (“Maker”) wins if at any point he has claimed s edges at a vertex without the second player (“Breaker”) having claimed a single edge at that vertex. If, by the end of play, this does not occur we say that Breaker wins. Our main aim is to show that for every s there is a graph G in which Maker has a winning strategy.