{"version":"1.0","type":"link","title":"Packing in a hypergraph - Newikis","description":"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. There are two famous algorithms to achieve asymptotically optimal packing in k-uniform hypergraphs. One of them…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/3/34/Hypergraph_packing.svg/1280px-Hypergraph_packing.svg.png","thumbnail_width":1280,"thumbnail_height":1851}