Doubly biased maker-breaker connectivity game

Dan Hefetz, Mirjana Mikalački, Miloš Stojaković

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper we study the (a: b) Maker-Breaker Connectivity game, played on the edge set of the complete graph on n vertices. We determine the winner for almost all values of a and b.

Original languageEnglish
Pages (from-to)1-17
Number of pages17
JournalElectronic Journal of Combinatorics
Volume19
DOIs
StatePublished - 31 Mar 2012
Externally publishedYes

Keywords

  • Biased games
  • Connectivity
  • Maker-breaker games

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Doubly biased maker-breaker connectivity game'. Together they form a unique fingerprint.

Cite this