Connected, bounded degree, triangle avoidance games

MaRDI QIDQ640454zbMATH OpenFDO

Authors Nishali Mehta, Ákos Seress

Publication date 18 October 2011

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i1p193.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) 2-person games (91A05)

Review text

Summary: We consider variants of the triangle-avoidance game first defined by Harary and rediscovered by Hajnal a few years later. A graph game begins with two players and an empty graph on \(n\) vertices. The two players take turns choosing edges within \(K_n\), building up a simple graph. The edges must be chosen according to a set of restrictions \(\mathcal R\). The winner is the last player to choose an edge that does not violate any of the restrictions in \(\mathcal R\). For fixed \(n\) and \(\mathcal R\), one of the players has a winning strategy. For a pair of games where \(\mathcal R\) includes bounded degree, connectedness, and triangle-avoidance, we determine the winner for all values of \(n\).

Recommendations

• Bounded degree, triangle avoidance graph games
• On Hajnal's triangle-free game
• On Degree Achievement and Avoidance Games for Graphs
• scientific article; zbMATH DE number 1735736
• Minimum degree games for graphs

Cited in

(13)

• On Hajnal's triangle-free game
• Minimum degree games for graphs
• On strong avoiding games
• A connected version of the graph coloring game
• Game saturation of intersecting families
• Bounded degree, triangle avoidance graph games
• Game matching number of graphs
• The star avoidance game
• scientific article; zbMATH DE number 3845628 (Why is no real title available?)
• scientific article; zbMATH DE number 3877237 (Why is no real title available?)
• scientific article; zbMATH DE number 140096 (Why is no real title available?)
• scientific article; zbMATH DE number 1735736 (Why is no real title available?)
• The constructor-blocker game

This page was built for publication: Connected, bounded degree, triangle avoidance games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q640454)