The first player wins the one-colour triangle avoidance game on 16 vertices

DOI10.7151/dmgt.1596zbMath1255.05121OpenAlexW2056892547MaRDI QIDQ2906377

Przemysław Gordinowicz, Paweł Prałat

Publication date: 5 September 2012

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1596

zbMATH Keywords

combinatorial gamestriangle avoidance game

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) 2-person games (91A05) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (4)

Bounded degree, triangle avoidance graph games ⋮ An upper bound on the extremal version of Hajnal's triangle-free game ⋮ Game matching number of graphs ⋮ Saturation games for odd cycles

Uses Software

• nauty

This page was built for publication: The first player wins the one-colour triangle avoidance game on 16 vertices