Two people play a game on a graph with 2022 points. Initially, there are no edges in the graph. They take turns and connect two non-neighbouring vertices with an edge. Whoever makes the graph connected loses. Which player has a winning strategy?ST, danny2915 combinatoricsgraph theoryIMOC