"triangle-free" meaning in English

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "triangle",
        "3": "free"
      },
      "expansion": "triangle + -free",
      "name": "suffix"
    }
  ],
  "etymology_text": "From triangle + -free.",
  "head_templates": [
    {
      "args": {
        "1": "-",
        "head": "triangle-free"
      },
      "expansion": "triangle-free (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": "other",
          "name": "English terms suffixed with -free",
          "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": [
        "Of an undirected graph in which no three vertices form a triangle of edges."
      ],
      "id": "en-triangle-free-en-adj-1r5ny~VA",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "undirected graph",
          "undirected graph#English"
        ],
        [
          "vertices",
          "vertex#English"
        ],
        [
          "triangle",
          "triangle#English"
        ],
        [
          "edges",
          "edge#English"
        ]
      ],
      "raw_glosses": [
        "(graph theory) Of an undirected graph in which no three vertices form a triangle of edges."
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "triangle-free"
}

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "triangle",
        "3": "free"
      },
      "expansion": "triangle + -free",
      "name": "suffix"
    }
  ],
  "etymology_text": "From triangle + -free.",
  "head_templates": [
    {
      "args": {
        "1": "-",
        "head": "triangle-free"
      },
      "expansion": "triangle-free (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 multiword terms",
        "English terms suffixed with -free",
        "English uncomparable adjectives",
        "en:Graph theory"
      ],
      "glosses": [
        "Of an undirected graph in which no three vertices form a triangle of edges."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "undirected graph",
          "undirected graph#English"
        ],
        [
          "vertices",
          "vertex#English"
        ],
        [
          "triangle",
          "triangle#English"
        ],
        [
          "edges",
          "edge#English"
        ]
      ],
      "raw_glosses": [
        "(graph theory) Of an undirected graph in which no three vertices form a triangle of edges."
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "triangle-free"
}