{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Statement\n\nLet $G$ be a finite nonempty [[graph|0JD5C82QMB]] in which every two distinct vertices have exactly one common [[neighbour|01T3TMGTTE]].\nThen $G$ has a vertex adjacent to all other vertices.\nConsequently, for some integer $k \\ge 0$, the graph $G$ consists of $k$ triangles that share one common vertex and are otherwise disjoint.\n\n## Remarks\n\nThe second sentence follows from the first.\nIf $w$ is adjacent to all other vertices, each other vertex $u$ has exactly one common neighbour with $w$.\nSo the vertices other than $w$ fall into pairs of adjacent vertices.\nFor the first sentence, suppose that no vertex is adjacent to all others.\nA counting argument shows that two non-adjacent vertices have the same degree, and from this that $G$ is $k$-regular for some $k$.\nThen the [[adjacency matrix|0NZ8MDBN6Q]] $A$ satisfies $A^2 = (k - 1) I + J$, where $J$ is the all-ones matrix, so the eigenvalues of $A$ are $k$ and $\\pm \\sqrt{k - 1}$.\nSince the trace of $A$ is $0$, the number $\\sqrt{k - 1}$ must be rational, and the multiplicities force $k = 2$.\nThen $G$ is a triangle, which has a vertex adjacent to all others, a contradiction.\nThe finiteness hypothesis is needed: there are infinite graphs in which every two vertices have exactly one common neighbour but no vertex is adjacent to all others.\nPaul Erdős, Alfréd Rényi and Vera Sós proved the theorem in 1966.\n\n## Explanations\n\n### L1 human\n\nSuppose that in a group of people, every two people have exactly one friend in common.\nThen someone is friends with everybody else, a \"politician\".\nMoreover, the rest of the group splits into pairs of friends, each pair together with the politician forming a triangle.\n\n### L2 human\n\nThe usual proof is a short application of linear algebra to a combinatorial condition: the hypothesis says exactly that $A^2 = (\\text{diagonal of degrees}) - I + J$.\nIt is a typical use of eigenvalues in [[spectral graph theory|5JESM2ZN48]], where integrality of eigenvalue multiplicities rules out most cases.\nThe graphs it describes, $k$ triangles glued at a vertex, are called friendship graphs or windmill graphs.\n",
  "commit": "547b6eddb8f2feb8d579f2d633d22a27b7e132fc",
  "front": {
    "about": [
      "0JD5C82QMB"
    ],
    "kind": "statement",
    "msc": [
      "05C75",
      "05C50"
    ],
    "name": "Friendship theorem",
    "role": "theorem",
    "sources": [
      {
        "url": "https://en.wikipedia.org/wiki/Friendship_graph"
      }
    ],
    "tag": "TN4GDFWGAR",
    "uses": [
      "0JD5C82QMB",
      "01T3TMGTTE",
      "0NZ8MDBN6Q"
    ]
  },
  "kind": "statement",
  "link": "https://math2.tamnd.com/node/TN4GDFWGAR/",
  "links": [
    {
      "field": "about",
      "target": "0JD5C82QMB"
    },
    {
      "field": "uses",
      "target": "0JD5C82QMB"
    },
    {
      "field": "uses",
      "target": "01T3TMGTTE"
    },
    {
      "field": "uses",
      "target": "0NZ8MDBN6Q"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/TN4GDFWGAR.md",
  "msc": [
    "05C75",
    "05C50"
  ],
  "name": "Friendship theorem",
  "prov": null,
  "role": "theorem",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/TN4/TN4GDFWGAR.md",
  "status": null,
  "tag": "TN4GDFWGAR",
  "uri": "m2://TN4GDFWGAR",
  "url": "https://math2.tamnd.com/wiki/friendship-theorem/",
  "writing": {
    "tag": "TN4GDFWGAR",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      },
      {
        "what": "a source with a locator",
        "have": 0,
        "want": 1
      }
    ]
  }
}