"Keller graph" meaning in English

{
  "etymology_text": "Named after Ott-Heinrich Keller.",
  "forms": [
    {
      "form": "Keller graphs",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Keller graph (plural Keller graphs)",
      "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": "Geometry",
          "orig": "en:Geometry",
          "parents": [
            "Mathematics",
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "Any of a certain family of graphs related to Keller's conjecture, such that the vertices of the Keller graph of dimension n are the 4ⁿ elements (m₁,...,mₙ) where each m is 0, 1, 2, or 3, and two vertices are joined by an edge if they differ in at least two coordinates and differ by exactly two in at least one coordinate."
      ],
      "id": "en-Keller_graph-en-noun-krYBSuFd",
      "links": [
        [
          "geometry",
          "geometry"
        ],
        [
          "family",
          "family"
        ],
        [
          "graph",
          "graph"
        ],
        [
          "Keller's conjecture",
          "Keller's conjecture"
        ],
        [
          "vertices",
          "vertex"
        ],
        [
          "element",
          "element"
        ],
        [
          "edge",
          "edge"
        ]
      ],
      "raw_glosses": [
        "(geometry) Any of a certain family of graphs related to Keller's conjecture, such that the vertices of the Keller graph of dimension n are the 4ⁿ elements (m₁,...,mₙ) where each m is 0, 1, 2, or 3, and two vertices are joined by an edge if they differ in at least two coordinates and differ by exactly two in at least one coordinate."
      ],
      "topics": [
        "geometry",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "Keller graph"
}

{
  "etymology_text": "Named after Ott-Heinrich Keller.",
  "forms": [
    {
      "form": "Keller graphs",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Keller graph (plural Keller graphs)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Geometry"
      ],
      "glosses": [
        "Any of a certain family of graphs related to Keller's conjecture, such that the vertices of the Keller graph of dimension n are the 4ⁿ elements (m₁,...,mₙ) where each m is 0, 1, 2, or 3, and two vertices are joined by an edge if they differ in at least two coordinates and differ by exactly two in at least one coordinate."
      ],
      "links": [
        [
          "geometry",
          "geometry"
        ],
        [
          "family",
          "family"
        ],
        [
          "graph",
          "graph"
        ],
        [
          "Keller's conjecture",
          "Keller's conjecture"
        ],
        [
          "vertices",
          "vertex"
        ],
        [
          "element",
          "element"
        ],
        [
          "edge",
          "edge"
        ]
      ],
      "raw_glosses": [
        "(geometry) Any of a certain family of graphs related to Keller's conjecture, such that the vertices of the Keller graph of dimension n are the 4ⁿ elements (m₁,...,mₙ) where each m is 0, 1, 2, or 3, and two vertices are joined by an edge if they differ in at least two coordinates and differ by exactly two in at least one coordinate."
      ],
      "topics": [
        "geometry",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "Keller graph"
}