1 paper · 2 filters
Jeremy Meza, Samuel Simon
We consider a game played on an initially empty graph where two players alternate drawing an edge between vertices subject to the condition that no degree can exceed k. We show t…