
Conjecture Suppose that for all edges
we have
. Then
is graphic.



Consider simple undirected graph and let
.
The imbalance of the edge defined as
.
The multiset of all edge imbalances of is denoted by
.
Note, that conjecture is verified for all such graphs with vertices.
Bibliography
* indicates original appearance(s) of problem.