A new Bound for the Maker-Breaker Triangle Game

2018/12/04 by Christian Glazik, Anand Srivastav, Glazik, Christian +1 · 2 citations
Computer Science · Economics, Econometrics and Finance · #Artificial Intelligence in Games #Combinatorics (math.CO) #FOS: Mathematics #Sports Analytics and Performance

paper · pdf · doi:10.48550/arxiv.1812.01382

openalex publication_date 2018/12/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The triangle game introduced by Chvátal and Erdős (1978) is one of the most famous combinatorial games. For n,q∈ℕ, the (n,q)-triangle game is played by two players, called Maker and Breaker, on the complete graph K_n. Alternately Maker claims one edge and thereafter Breaker claims q edges of the graph. Maker wins the game if he can claim all three edges of a triangle, otherwise Breaker wins. Chvátal and Erdős (1978) proved that for q

Cited by

• The Maker-Breaker directed triangle game
• Structure-biased Maker-Breaker Games

Related

• A Constructive Winning Maker Strategy in the Maker-Breaker C₄-Game
• A Strategy for Maker in the Clique Game which Helps to Tackle some Open Problems by Beck
• The Maker-Breaker directed triangle game
• Maker-Breaker-Crossing-Game on the Triangular Grid-graph
• Doubly biased Maker-Breaker Connectivity game