hh

A sequence of integers is called graphical if there exists a graph with it as its degree sequence. A theorem by Erdős and Gallai characterizes which sequences are graphical, but gives no algorithm to explicitly construct such a graph. Can you construct it?

Solve this puzzle by clicking here.