|
Organizers |
Triangle-avoidance games
by
Akos Seress
The Ohio State University
Coauthors: Nishali Mehta
Starting with the empty graph on n vertices, two players alternatingly draw edges, with the rule that the created graph must be triangle-free. The loser is the first player who cannot move.
We discuss variants of the game and a related extremal graph problem.
Date received: April 16, 2009
Copyright © 2009 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cayq-23.