Random close pack crystal lattices have maximum densities equal to this upper limit. Random close packing does not have a precise geometric definition. It is defined statistically, and results are empirical. A container is randomly filled with objects, and then the container is shaken or tapped until the objects do not compact any further, at this point the packing state is RCP. The definition of packing fraction can be given as: "the volume taken by number of particles in a given space of volume". In other words, packing fraction defines the packing density. It has been shown that the filling fraction increases with
Packing in a hypergraph a hypergraph packing if it is a subset of edges in H such that there is no pair of distinct edges with a common vertex. formula_2 is a (formula_3,formula_4)-good hypergraph if there exists a formula_3 such that for all formula_6 and formula_7 and both of the following conditions hold. where the "degree" deg("x") of a vertex "x" is the number of edges that contain "x" and the "codegree" codeg("x", "y") of two distinct vertices "x" and "y" is the number of edges that contain both vertices. There exists an asymptotic packing "P" of size at least formula_10 for a formula_11-uniform