MathCastle
Graph TheoryMediumGraphs and Degrees

Graphs and Degrees · Medium problem

The degree sequence (3,3,3,1)(3,3,3,1) has an even sum (1010), yet Havel–Hakimi shows it is NOT graphical. What is the smallest amount you can add to the single smallest term (11) so that the resulting sequence becomes graphical?