We are given n points in space. Some pairs of these points are connected by line segments so that the number of segments equals [n2/4], and a connected triangle exists. Prove that any point from which the maximal number of segments starts is a vertex of a connected triangle. combinatorics proposedcombinatorics