"subhypergraph" meaning in All languages combined

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "sub",
        "3": "hypergraph"
      },
      "expansion": "sub- + hypergraph",
      "name": "prefix"
    }
  ],
  "etymology_text": "From sub- + hypergraph.",
  "forms": [
    {
      "form": "subhypergraphs",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "subhypergraph (plural subhypergraphs)",
      "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": "English terms prefixed with sub-",
          "parents": [],
          "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": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "2016, Reza Jafarpour-Golzari, “A generalization of hall's theorem for k-uniform k-partite hypergraphs”, in arXiv:",
          "text": "More precisely, let H be a k-uniform k- partite hypergraph with some ordering on parts as V1, V2,..., Vk. such that the subhypergraph generated on union of V1, V2,..., Vk-1 has a unique perfect matching.",
          "type": "quote"
        },
        {
          "ref": "2016, Meysam Alishahi, “Colorful Subhypergraphs in Uniform Hypergraphs”, in arXiv:",
          "text": "Next, Meunier [Colorful subhypergraphs in Kneser hypergraphs, The Electronic Journal of Combinatorics, 2014] improved their result by proving that any properly colored general Kneser hypergraph #123;#92;rmKG#125;ʳ(#123;#92;mathcalH#125;) contains a large colorful r-partite subhypergraph provided that r is prime.",
          "type": "quote"
        }
      ],
      "glosses": [
        "A subset of a hypergraph"
      ],
      "id": "en-subhypergraph-en-noun-xYAToVzy",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "subset",
          "subset"
        ],
        [
          "hypergraph",
          "hypergraph"
        ]
      ],
      "raw_glosses": [
        "(mathematics) A subset of a hypergraph"
      ],
      "topics": [
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "subhypergraph"
}

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "sub",
        "3": "hypergraph"
      },
      "expansion": "sub- + hypergraph",
      "name": "prefix"
    }
  ],
  "etymology_text": "From sub- + hypergraph.",
  "forms": [
    {
      "form": "subhypergraphs",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "subhypergraph (plural subhypergraphs)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English nouns",
        "English terms prefixed with sub-",
        "English terms with quotations",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Mathematics"
      ],
      "examples": [
        {
          "ref": "2016, Reza Jafarpour-Golzari, “A generalization of hall's theorem for k-uniform k-partite hypergraphs”, in arXiv:",
          "text": "More precisely, let H be a k-uniform k- partite hypergraph with some ordering on parts as V1, V2,..., Vk. such that the subhypergraph generated on union of V1, V2,..., Vk-1 has a unique perfect matching.",
          "type": "quote"
        },
        {
          "ref": "2016, Meysam Alishahi, “Colorful Subhypergraphs in Uniform Hypergraphs”, in arXiv:",
          "text": "Next, Meunier [Colorful subhypergraphs in Kneser hypergraphs, The Electronic Journal of Combinatorics, 2014] improved their result by proving that any properly colored general Kneser hypergraph #123;#92;rmKG#125;ʳ(#123;#92;mathcalH#125;) contains a large colorful r-partite subhypergraph provided that r is prime.",
          "type": "quote"
        }
      ],
      "glosses": [
        "A subset of a hypergraph"
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "subset",
          "subset"
        ],
        [
          "hypergraph",
          "hypergraph"
        ]
      ],
      "raw_glosses": [
        "(mathematics) A subset of a hypergraph"
      ],
      "topics": [
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "subhypergraph"
}