5 papers
Faster Algorithms for Deciding the Unbiased Maker-Breaker Triangle Game on General Graphs
Julian Christoph Brinkmann, Anand Srivastav
In this paper, we present new polynomial-time algorithms for determining the winner of the unbiased triangle game played on the edge set of general graphs. To that end, we propose…
Constructive Winning Breaker Strategies in the Maker-Breaker -Game
Matthias Sowa, Anand Srivastav
Maker-Breaker subgraph games are among the most famous combinatorial games. For and a fixed subgraph of the complete graph , the two players, called Mak…
Chromatic number of randomly augmented graphs
Jan Geest, Anand Srivastav
An extension of the ErdÅs-Renyi random graph model is the model of perturbed graphs introduced by Bohman, Frieze and Martin (Bohman, Frieze, Martin 2003). This is a spec…
A Constructive Winning Maker Strategy in the Maker-Breaker -Game
Matthias Sowa, Anand Srivastav
Maker-Breaker subgraph games are among the most famous combinatorial games. For given and a subgraph of the complete graph , the two players, called M…
Asymptotically Optimal Threshold Bias for the Maker-Breaker Minimum Degree, Connectivity and Hamiltonicity Games
Adnane Fouadi, Mourad El Ouali, Anand Srivastav
We study the Maker-Breaker subgraph game played on the edges of the complete graph on vertices, where the goal of Maker is to build a copy…