Definitions from Wikipedia (Packing in a hypergraph)

▸ noun:  In mathematics, a packing in a hypergraph is a partition of the set of the hypergraph's edges into a number of disjoint subsets such that no pair of edges in each subset share any vertex.


▸ Words similar to packing in a hypergraph
▸ Usage examples for packing in a hypergraph

▸ Idioms related to packing in a hypergraph
▸ Wikipedia articles (New!)
▸ Words that often appear near packing in a hypergraph
▸ Rhymes of packing in a hypergraph

▸ Invented words related to packing in a hypergraph