We label every edge of a simple graph with the difference of the degrees of its endpoints. If the number of vertices is N, what can be the largest value of the sum of the labels on the edges?Proposed by Dániel Lenger and Gábor Szűcs, Budapest
combinatoricsgraph theory