An upper bound on the extremal version of Hajnal's triangle-free game

DOI10.1016/j.dam.2015.06.031zbMath1326.05091arXiv1409.8141OpenAlexW1882048990MaRDI QIDQ897581

Csaba Biró, D. Jacob Wildstrom, Paul S. Horn

Publication date: 7 December 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1409.8141

zbMATH Keywords

triangle-free graphgame saturationHajnal game

Mathematics Subject Classification ID

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

Related Items (6)

Bounded degree, triangle avoidance graph games ⋮ Linear bounds for cycle-free saturation games ⋮ On saturation games ⋮ \(\mathcal{F}\)-saturation games ⋮ Saturation games for odd cycles ⋮ The Game Saturation Number of a Graph

Cites Work

• The triangle-free process
• On Hajnal's triangle-free game
• A bound for the game chromatic number of graphs
• Game matching number of graphs
• The first player wins the one-colour triangle avoidance game on 16 vertices
• Domination Game and an Imagination Strategy
• Toppling numbers of complete and random graphs
• The Game Saturation Number of a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An upper bound on the extremal version of Hajnal's triangle-free game