Let $G=(V,E)$ be a finite, simple, undirected graph. Let $\Delta(G)$ be the maximal degree of $G$. Is there a finite graph $G'=(V', E')$ with the following properties?


1. $V\subseteq V'$,
2. $E \subseteq E'$, and
3. $G'$ is $\Delta(G)$-regular.



Regularization of arbitrary graphs
Yes. First of all, for any vertex $v\in V$ we draw the edges to $\Delta(G)-\deg(v)$ new vertices so that the degree of $v$ becomes equal to $\Delta(G)$. Now all degrees are equal either to $\Delta(G)$ or to 1. Without loss of generality, the number of vertices with degree 1 is even (else add the disjoint copy of the current graph). Partition them onto pairs, and for any pair $a,b$ take a graph $K\_{d+1}\setminus \{ab\}$ on the vertex set $\{a,b, d-1\, \text{new vertices}\}$. 


