"Grötzsch graph" meaning in English

{
  "etymology_text": "Named after German mathematician Herbert Grötzsch.",
  "forms": [
    {
      "form": "Grötzsch graphs",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Grötzsch graph (plural Grötzsch 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": "Graph theory",
          "orig": "en:Graph theory",
          "parents": [
            "Mathematics",
            "Visualization",
            "Formal sciences",
            "Computing",
            "Interdisciplinary fields",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A triangle-free graph with 11 vertices, 20 edges, chromatic number 4, and crossing number 5. It is a member of an infinite sequence of triangle-free graphs, each the Mycielskian of the previous graph in the sequence."
      ],
      "id": "en-Grötzsch_graph-en-noun-NB1fkU2i",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "triangle",
          "triangle"
        ],
        [
          "graph",
          "graph"
        ],
        [
          "vertices",
          "vertex"
        ],
        [
          "edge",
          "edge"
        ],
        [
          "chromatic number",
          "chromatic number"
        ],
        [
          "crossing number",
          "crossing number"
        ],
        [
          "infinite",
          "infinite"
        ],
        [
          "sequence",
          "sequence"
        ],
        [
          "Mycielskian",
          "Mycielskian"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A triangle-free graph with 11 vertices, 20 edges, chromatic number 4, and crossing number 5. It is a member of an infinite sequence of triangle-free graphs, each the Mycielskian of the previous graph in the sequence."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "Grötzsch graph"
}

{
  "etymology_text": "Named after German mathematician Herbert Grötzsch.",
  "forms": [
    {
      "form": "Grötzsch graphs",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Grötzsch graph (plural Grötzsch 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",
        "English terms spelled with Ö",
        "English terms spelled with ◌̈",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Graph theory"
      ],
      "glosses": [
        "A triangle-free graph with 11 vertices, 20 edges, chromatic number 4, and crossing number 5. It is a member of an infinite sequence of triangle-free graphs, each the Mycielskian of the previous graph in the sequence."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "triangle",
          "triangle"
        ],
        [
          "graph",
          "graph"
        ],
        [
          "vertices",
          "vertex"
        ],
        [
          "edge",
          "edge"
        ],
        [
          "chromatic number",
          "chromatic number"
        ],
        [
          "crossing number",
          "crossing number"
        ],
        [
          "infinite",
          "infinite"
        ],
        [
          "sequence",
          "sequence"
        ],
        [
          "Mycielskian",
          "Mycielskian"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A triangle-free graph with 11 vertices, 20 edges, chromatic number 4, and crossing number 5. It is a member of an infinite sequence of triangle-free graphs, each the Mycielskian of the previous graph in the sequence."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "Grötzsch graph"
}