Ability to use about six hops to reach any other node in an extremely large social network

Erdos number of all scholars having written papers with Paul Erdos

Maximum number of edges between nodes in a graph with a diameter of six

Typical distance between nodes that are connected by triadic closure