Title of article
Perfect matchings in pruned grid graphs
Author/Authors
David R. Guichard، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
6
From page
6552
To page
6557
Abstract
We determine conditions sufficient to guarantee the existence of a perfect matching when vertices are removed from finite and infinite grid graphs. The conditions impose a minimum distance between the vertices that are removed. While the distances are likely not best possible, they are best possible with respect to asymptotic growth rate.
Keywords
Weak win , Winning strategy , Drawing strategy , Euclidean Ramsey Theory , Combinatorial game , Tic-Tac-Toe game , Achievement game , Strong win
Journal title
Discrete Mathematics
Serial Year
2008
Journal title
Discrete Mathematics
Record number
946907
Link To Document