Planar Graphs · Easy problem

A connections diagram among $13$ people is to be drawn flat with no two lines crossing, with the rule that no three people may all be mutually connected (no triangles in the diagram). What is the maximum number of connections possible?