Question
2. Let n N and let d be a list of n nonnegative integers with even sum whose largest entry is less than n and differs from the smallest entry by at most 1 (e.g., 443333 or 33333322). Prove that d is graphic. Conclude that there is a k-regular n-vertex simple graph if and only if k < n and kn is even. Comment: It might
Question image 1