"altermatic" meaning in All languages combined

{
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "altermatic (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "2015, Meysam Alishahi, Hossein Hajiabolhassan, “On The Chromatic Number of Matching Graphs”, in arXiv",
          "text": "In this paper, as a generalization of the well-known result of Schrijver about the chromatic number of Schrijver graphs, we determine the chromatic number of a large family of matching graphs by specifying their altermatic number.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "Describing a lower bound of a chromatic number of a graph"
      ],
      "id": "en-altermatic-en-adj-Rfgcn80J",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "lower",
          "lower"
        ],
        [
          "bound",
          "bound"
        ],
        [
          "chromatic number",
          "chromatic number"
        ],
        [
          "graph",
          "graph"
        ]
      ],
      "raw_glosses": [
        "(mathematics) Describing a lower bound of a chromatic number of a graph"
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "altermatic"
}

{
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "altermatic (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "senses": [
    {
      "categories": [
        "English adjectives",
        "English entries with incorrect language header",
        "English lemmas",
        "English terms with quotations",
        "English uncomparable adjectives",
        "en:Mathematics"
      ],
      "examples": [
        {
          "ref": "2015, Meysam Alishahi, Hossein Hajiabolhassan, “On The Chromatic Number of Matching Graphs”, in arXiv",
          "text": "In this paper, as a generalization of the well-known result of Schrijver about the chromatic number of Schrijver graphs, we determine the chromatic number of a large family of matching graphs by specifying their altermatic number.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "Describing a lower bound of a chromatic number of a graph"
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "lower",
          "lower"
        ],
        [
          "bound",
          "bound"
        ],
        [
          "chromatic number",
          "chromatic number"
        ],
        [
          "graph",
          "graph"
        ]
      ],
      "raw_glosses": [
        "(mathematics) Describing a lower bound of a chromatic number of a graph"
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "altermatic"
}