Show that degree sequence is graphic

36 Views Asked by At

We have to show that the degree sequence (n,n,n-1,n-1,...,3,3,2,2,1,1) is graphic for all n bigger or equal to 1. I used the technique where you delete the first degree (n) in the sequence and then for the next n degrees you substract one, but I get stuck at actually subtracting 1 from n degrees. Not sure if I’m on the right path.