A pair of mathematicians solved a legendary question about the proportion of vertices in a graph with an odd number of connections. “It’s a bit of a surprise, at least for me, that such a combination ...

Nelson asked: What is the smallest number of colors that you’d need to color any such graph, even one formed by linking an infinite number of vertices? The problem, now known as the Hadwiger-Nelson ...

In our model, the players of an evolutionary game occupy the vertices of a graph. The edges denote links between individuals in terms of game dynamical interaction and biological reproduction.