英和和英

名詞

subhypergraph (複数形 subhypergraphs)

1. (mathematics) A subset of a hypergraph
   • 2016, Reza Jafarpour-Golzari, “A generalization of hall's theorem for k-uniform k-partite hypergraphs”, in arXiv‎^[1]:

     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.

   • 2016, Meysam Alishahi, “Colorful Subhypergraphs in Uniform Hypergraphs”, in arXiv‎^[2]:

     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 ${\displaystyle {\rm {KG}}^{r}({\mathcal {H}})}$ contains a large colorful ${\displaystyle r}$-partite subhypergraph provided that ${\displaystyle r}$ is prime.