  In this short article, we consider a problem about $2$-partition of the
vertices of a graph. If a graph admits such a partition into some 'small'
graphs, then the number of edges cross an arbitrary cut of the graph
$e(S,S^{c})$ has a nice lower bound.
