Game matching number of graphs

Daniel W. Cranston, William B. Kinnersley, Suil O. +1

We study a competitive optimization version of ${\alpha }^{\prime }(G)$, the maximum size of a matching in a graph $G$. Players alternate adding edges of $G$ to a matching until it becomes a maxima…