"quasi-transitive" meaning in English

{
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "quasi-transitive (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": "Graph theory",
          "orig": "en:Graph theory",
          "parents": [
            "Mathematics",
            "Visualization",
            "Formal sciences",
            "Computing",
            "Interdisciplinary fields",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "Such that its vertex set can be partitioned into finitely many sets, so that there exists an automorphism mapping a vertex to another vertex if and only if the two vertices belong to the same set in that partition."
      ],
      "id": "en-quasi-transitive-en-adj-B~znk~xC",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "graph",
          "graph"
        ],
        [
          "automorphism",
          "automorphism"
        ],
        [
          "if and only if",
          "if and only if"
        ]
      ],
      "raw_glosses": [
        "(graph theory, of a graph) Such that its vertex set can be partitioned into finitely many sets, so that there exists an automorphism mapping a vertex to another vertex if and only if the two vertices belong to the same set in that partition."
      ],
      "raw_tags": [
        "of a graph"
      ],
      "related": [
        {
          "word": "transitive"
        }
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "quasi-transitive"
}

{
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "quasi-transitive (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "related": [
    {
      "word": "transitive"
    }
  ],
  "senses": [
    {
      "categories": [
        "English adjectives",
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English uncomparable adjectives",
        "en:Graph theory"
      ],
      "glosses": [
        "Such that its vertex set can be partitioned into finitely many sets, so that there exists an automorphism mapping a vertex to another vertex if and only if the two vertices belong to the same set in that partition."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "graph",
          "graph"
        ],
        [
          "automorphism",
          "automorphism"
        ],
        [
          "if and only if",
          "if and only if"
        ]
      ],
      "raw_glosses": [
        "(graph theory, of a graph) Such that its vertex set can be partitioned into finitely many sets, so that there exists an automorphism mapping a vertex to another vertex if and only if the two vertices belong to the same set in that partition."
      ],
      "raw_tags": [
        "of a graph"
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "quasi-transitive"
}