MathNet 1981 — Part 01 Question 4

A graph has 100 points. Given any four points, there is one joined to the other three. Show that one point must be joined to all 99 other points. What is the smallest number possible of such points (that are joined to all the others)?