Anand Srivastav

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2026

Constructive Winning Breaker Strategies in the Maker-Breaker $C_{k}$ -Game

Matthias Sowa, Anand Srivastav

Maker-Breaker subgraph games are among the most famous combinatorial games. For $n, q \in N$ and a fixed subgraph $C$ of the complete graph $K_{n}$ , the two players, called Mak…

math.CO2024

Chromatic number of randomly augmented graphs

Jan Geest, Anand Srivastav

An extension of the Erdős-Renyi random graph model $G_{n, p}$ is the model of perturbed graphs introduced by Bohman, Frieze and Martin (Bohman, Frieze, Martin 2003). This is a speci…

math.CO2024

A Constructive Winning Maker Strategy in the Maker-Breaker $C_{4}$ -Game

Matthias Sowa, Anand Srivastav

Maker-Breaker subgraph games are among the most famous combinatorial games. For given $n, q \in N$ and a subgraph $C$ of the complete graph $K_{n}$ , the two players, called M…

math.CO2024

Asymptotically Optimal Threshold Bias for the $(a : b)$ Maker-Breaker Minimum Degree, Connectivity and Hamiltonicity Games

Adnane Fouadi, Mourad El Ouali, Anand Srivastav

We study the $(a : b)$ Maker-Breaker subgraph game played on the edges of the complete graph $K_{n}$ on $n$ vertices, $n, a, b \in N$ where the goal of Maker is to build a copy…

Constructive Winning Breaker Strategies in the Maker-Breaker Ck​-Game

Chromatic number of randomly augmented graphs

A Constructive Winning Maker Strategy in the Maker-Breaker C4​-Game

Asymptotically Optimal Threshold Bias for the (a:b) Maker-Breaker Minimum Degree, Connectivity and Hamiltonicity Games

Constructive Winning Breaker Strategies in the Maker-Breaker $C_{k}$ -Game

A Constructive Winning Maker Strategy in the Maker-Breaker $C_{4}$ -Game

Asymptotically Optimal Threshold Bias for the $(a : b)$ Maker-Breaker Minimum Degree, Connectivity and Hamiltonicity Games