I’ve always liked graph theory. Unfortunately, this sympathy is largely unrequited, because I did not have very good grades in the discrete mathematics that covers this theory. Nevertheless, today I would like to recommend a game closely related to this field.

It’s about Planarity. It consists in arranging the vertices of a given planar graph in such a way that none of its edges intersects. Of course, for small graphs it is simple, but when the number of vertices exceeds a dozen or so, it becomes already dense in the drawing.

This is a planar graph
This is a planar graph
This is a planar graph
This is a planar graph
This is a planar graph
This is a planar graph

Looks like an interesting fun ;)


Reference:

  1. https://mathigon.org/
  2. Planar graph