"anarboricity" meaning in All languages combined

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "an-",
        "3": "arboricity"
      },
      "expansion": "an- + arboricity",
      "name": "af"
    }
  ],
  "etymology_text": "an- + arboricity. Coined by Ronald C. Read; the etymologically inaccurate Greek prefix an- was chosen to achieve a pun on the name of Ann Arbor, where the University of Michigan is based.",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "anarboricity (uncountable)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "antonyms": [
        {
          "word": "arboricity"
        }
      ],
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms prefixed with an-",
          "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": [
        "The maximum number of edge-disjoint cyclic subgraphs of a graph G whose union is G."
      ],
      "id": "en-anarboricity-en-noun-8H8SPa1X",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "edge-disjoint",
          "edge-disjoint"
        ],
        [
          "cyclic",
          "cyclic"
        ],
        [
          "subgraph",
          "subgraph"
        ],
        [
          "union",
          "union"
        ]
      ],
      "raw_glosses": [
        "(graph theory) The maximum number of edge-disjoint cyclic subgraphs of a graph G whose union is G."
      ],
      "tags": [
        "uncountable"
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Ronald C. Read",
        "University of Michigan"
      ]
    }
  ],
  "word": "anarboricity"
}

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "an-",
        "3": "arboricity"
      },
      "expansion": "an- + arboricity",
      "name": "af"
    }
  ],
  "etymology_text": "an- + arboricity. Coined by Ronald C. Read; the etymologically inaccurate Greek prefix an- was chosen to achieve a pun on the name of Ann Arbor, where the University of Michigan is based.",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "anarboricity (uncountable)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "antonyms": [
        {
          "word": "arboricity"
        }
      ],
      "categories": [
        "English entries with incorrect language header",
        "English lemmas",
        "English nouns",
        "English terms prefixed with an-",
        "English uncountable nouns",
        "en:Graph theory"
      ],
      "glosses": [
        "The maximum number of edge-disjoint cyclic subgraphs of a graph G whose union is G."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "edge-disjoint",
          "edge-disjoint"
        ],
        [
          "cyclic",
          "cyclic"
        ],
        [
          "subgraph",
          "subgraph"
        ],
        [
          "union",
          "union"
        ]
      ],
      "raw_glosses": [
        "(graph theory) The maximum number of edge-disjoint cyclic subgraphs of a graph G whose union is G."
      ],
      "tags": [
        "uncountable"
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Ronald C. Read",
        "University of Michigan"
      ]
    }
  ],
  "word": "anarboricity"
}