SHUTOUT GAMES ON GRAPHS

Alexandru Cioba; Michail Savvas

doi:10.1112/S0025579314000382

Back

Journal article

Peer reviewed

SHUTOUT GAMES ON GRAPHS

Alexandru Cioba and Michail Savvas

Mathematika, Vol.61(3), pp.523-530

09/01/2015

DOI: 10.1112/S0025579314000382

View Online

Abstract

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.

Mathematics

Mathematics, Applied

Physical Sciences

Science & Technology

Details

Title: Subtitle: SHUTOUT GAMES ON GRAPHS
Creators: Alexandru Cioba - University College London
Michail Savvas - Stanford University
Resource Type: Journal article
Publication Details: Mathematika, Vol.61(3), pp.523-530
Publisher: Wiley
DOI: 10.1112/S0025579314000382
ISSN: 0025-5793
eISSN: 2041-7942
Number of pages: 8
Grant note: Heilbronn Fund Woods Fund
Language: English
Date published: 09/01/2015
Academic Unit: Mathematics
Record Identifier: 9984696713902771

Metrics

1 Record Views