Graph Generation

Generate a graph for a given degree distribution. Example: D = [3,3,2,2,1]

Is it possible to do for any sequence D?


In [ ]:

Generate a 2-colorable graph, and a 3-colorable graph


In [ ]:

Generate a graph $G(n, p)$ in the Erdős–Rényi for different p

Use interact() to vary p, and print the size of the largest connected component when varying $p$


In [ ]: