Re:What a Math Party Game Tells Us About Graph Theory
by tromp on Saturday April 09, 2022 @03:40AM
(#30965972)
> a graph with an odd number of vertices can't have an odd number of edges.
A 3 node graph can have 1 edge. The article is about a different notion of oddness, namely that all nodes have an odd degree.
And like I said, it really depends on the other rules which are never explicitly stated.
But I have a sneaking suspicion that discussing the game is arguing the metaphor.
The game is just there to help us get to the realization that graphs with an even number of vertices can have an odd number of edges, but a graph with an odd number of vertices can't have an odd number of edges.