To illustrate the different nature of the results in [1] and the
present note, a special result in [1] (see also [2]) says that every graph with n vertices
and at least 2n+1 edges contains a non-empty subgraph in which each vertex has degree
divisible by 3.