Prove that for any integer n>=5 there exists a graph with n vertices all of which have degree 4.
How do I prove this? I assume by induction with n=5 as the initial step (easy using Havel-Hakimi), then assume works for n, show works for n+1, but it gets messy. Can you show me the induction or have any other method to prove this?
Thanks.
SCB