|
|||||
|
|
Asymptotic packing via a branching process |
|
| Authors: | Joel Spencer |
| Abstract: | It is shown that under certain side conditions the natural random greedy algorithm almost always provides an asymptotically optimal packing of disjoint hyperedges from a hypergraph H. |
| Keywords: | |