Packing in a hypergraph
id:
packing-in-a-hypergraph-314-17572157
title:
Packing in a hypergraph
text:
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 is a random greedy algorithm which was proposed by Joel Spencer. He used a branching process to formally prove the optimal achievable bound under some side conditions. The other algorithm is called th
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Packing_in_a_hypergraph
date created:
date modified:
2024-01-03T20:06:35Z
main entity:
{"identifier":"Q7123028","url":"https://www.wikidata.org/entity/Q7123028"}
image:
fields total:
13
integrity:
13