#23. More Bricks—More Walls?

Published

30 Nov, 2023

(Back to course page.)

Link to Slides · Link to recording

Prompts for discussion:

For readers familiar with the notion of graph isomorphism, the following might be a rewarding exercise in applying the method shown above: Prove that if \(g_n(k)\) stands for the number of nonisomorphic graphs with \(n\) vertices and \(k\) edges, then the sequence \(g_n(0), g_n(1), \ldots, g_n\left(\left(\begin{array}{c}n \\ 2\end{array}\right)\right)\) is unimodal.

(From the miniature.)