"Cayley's formula" meaning in All languages combined

{
  "etymology_text": "Named in honour of Arthur Cayley.",
  "forms": [
    {
      "form": "Cayley's theorem",
      "tags": [
        "canonical"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "-",
        "head": "Cayley's theorem"
      },
      "expansion": "Cayley's theorem (uncountable)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Graph theory",
          "orig": "en:Graph theory",
          "parents": [
            "Mathematics",
            "Visualization",
            "Formal sciences",
            "Computing",
            "Interdisciplinary fields",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A formula for the number of spanning trees of a complete graph of n vertices: nⁿ⁻²."
      ],
      "id": "en-Cayley's_formula-en-noun-Lb5cf8dV",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "spanning trees",
          "spanning trees"
        ],
        [
          "complete graph",
          "complete graph"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A formula for the number of spanning trees of a complete graph of n vertices: nⁿ⁻²."
      ],
      "tags": [
        "uncountable"
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Arthur Cayley",
        "Cayley's formula"
      ]
    }
  ],
  "word": "Cayley's formula"
}

{
  "etymology_text": "Named in honour of Arthur Cayley.",
  "forms": [
    {
      "form": "Cayley's theorem",
      "tags": [
        "canonical"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "-",
        "head": "Cayley's theorem"
      },
      "expansion": "Cayley's theorem (uncountable)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Graph theory"
      ],
      "glosses": [
        "A formula for the number of spanning trees of a complete graph of n vertices: nⁿ⁻²."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "spanning trees",
          "spanning trees"
        ],
        [
          "complete graph",
          "complete graph"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A formula for the number of spanning trees of a complete graph of n vertices: nⁿ⁻²."
      ],
      "tags": [
        "uncountable"
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Arthur Cayley",
        "Cayley's formula"
      ]
    }
  ],
  "word": "Cayley's formula"
}