Packing in a hypergraph

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 the Rödl nibble and was proposed by Vojtěch Rödl et al. They showed that the achievable packing by the Rödl nibble is in some sense close to that of the random greedy algorithm.

The problem of finding the number of such subsets in a k-uniform hypergraph was originally motivated through a conjecture by Paul Erdős and Haim Hanani in 1963. Vojtěch Rödl proved their conjecture asymptotically under certain conditions in 1985. Pippenger and Joel Spencer generalized Rödl's results using a random greedy algorithm in 1989.

In the following definitions, the hypergraph is denoted by H=(V,E). H is called a k-uniform hypergraph if every edge in E consists of exactly k vertices.

P {\displaystyle P} is 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.

H {\displaystyle H} is a ( D 0 {\displaystyle D_{0}} , ϵ {\displaystyle \epsilon } )-good hypergraph if there exists a D 0 {\displaystyle D_{0}} such that for all x , y ∈ V {\displaystyle x,y\in V} and D ≥ D 0 {\displaystyle D\geq D_{0}} and both of the following conditions hold.

D ( 1 − ϵ ) ≤ deg ( x ) ≤ D ( 1 + ϵ ) {\displaystyle D(1-\epsilon )\leq {\text{deg}}(x)\leq D(1+\epsilon )}

codeg ( x , y ) ≤ ϵ D {\displaystyle {\text{codeg}}(x,y)\leq \epsilon D}

where the degree deg ( x ) {\displaystyle {\text{deg}}(x)} of a vertex x {\displaystyle x} is the number of edges that contain x {\displaystyle x} and the codegree codeg ( x , y ) {\displaystyle {\text{codeg}}(x,y)} of two distinct vertices x {\displaystyle x} and y {\displaystyle y} is the number of edges that contain both vertices.

There exists an asymptotic packing P of size at least n K + 1 ( 1 − o ( 1 ) ) {\displaystyle {\frac {n}{K+1}}(1-o(1))} for a ( K + 1 ) {\displaystyle (K+1)} -uniform hypergraph under the following two conditions,

1. All vertices have the degree of D ( 1 + o ( 1 ) ) {\displaystyle D(1+o(1))} in which D {\displaystyle D} tends to infinity.
2. For every pair of vertices shares only o ( D ) {\displaystyle o(D)} common edges.

where n {\displaystyle n} is the total number of vertices. This result was shown by Pippenger and was later proved by Joel Spencer. To address the asymptotic hypergraph packing problem, Joel Spencer proposed a random greedy algorithm. In this algorithm, a branching process is used as the basis and it was shown that it almost always achieves an asymptotically optimal packing under the above side conditions.

There are two famous algorithms for asymptotic packing of k-uniform hypergraphs: the random greedy algorithm via branching process, and the Rödl nibble.

Every edge E ∈ H {\displaystyle E\in H} is independently and uniformly assigned a distinct real "birthtime" t E ∈ [ 0 , D ] {\displaystyle t_{E}\in [0,D]} . The edges are taken one by one in the order of their birthtimes. The edge E {\displaystyle E} is accepted and included in P {\displaystyle P} if it does not overlap any previously accepted edges. Obviously, the subset P {\displaystyle P} is a packing and it can be shown that its size is | P | = n K + 1 {\displaystyle |P|={\frac {n}{K+1}}} almost surely. To show that, let stop the process of adding new edges at time c {\displaystyle c} . For an arbitrary γ > 0 {\displaystyle \gamma >0} , pick c , D 0 , ϵ {\displaystyle c,D_{0},\epsilon } such that for any ( D 0 , ϵ ) {\displaystyle (D_{0},\epsilon )} -good hypergraph f x , H ( c ) < γ 2 {\displaystyle f_{x,H}(c)<\gamma ^{2}} where f x , H ( c ) {\displaystyle f_{x,H}(c)} denotes the probability of vertex x {\displaystyle x} survival (a vertex survives if it is not in any edges in P {\displaystyle P} ) until time c {\displaystyle c} . Obviously, in such a situation the expected number of x {\displaystyle x} surviving at time c {\displaystyle c} is less than γ 2 n {\displaystyle \gamma ^{2}n} . As a result, the probability of x {\displaystyle x} surviving being less than γ n {\displaystyle \gamma n} is higher than 1 − γ {\displaystyle 1-\gamma } . In other words, P c {\displaystyle P_{c}} must include at least ( 1 − γ ) n {\displaystyle (1-\gamma )n} vertices which means that | P | ≥ ( 1 − γ ) n K + 1 {\displaystyle |P|\geq (1-\gamma ){\frac {n}{K+1}}} .

To complete the proof, it must be shown that lim c → ∞ lim x , H f x , H ( c ) = 0 {\displaystyle \lim _{c\rightarrow \infty }\lim _{x,H}f_{x,H}(c)=0} . For that, the asymptotic behavior of x {\displaystyle x} surviving is modeled by a continuous branching process. Fix c > 0 {\displaystyle c>0} and begin with Eve with the birthdate of c {\displaystyle c} . Assume time goes backward so Eve gives birth in the interval of [ 0 , c ) {\displaystyle [0,c)} with a unit density Poisson distribution. The probability of Eve having k {\displaystyle k} birth is e − c c k k ! {\displaystyle {\frac {e^{-c}c^{k}}{k!}}} . By conditioning on k {\displaystyle k} the birthtimes x 1 , . . . , x k {\displaystyle x_{1},...,x_{k}} are independently and uniformly distributed on [ 0 , c ) {\displaystyle [0,c)} . Every birth given by Eve consists of Q {\displaystyle Q} offspring all with the same birth time say a {\displaystyle a} . The process is iterated for each offspring. It can be shown that for all ϵ > 0 {\displaystyle \epsilon >0} there exists a K {\displaystyle K} so that with a probability higher than ( 1 − ϵ ) {\displaystyle (1-\epsilon )} , Eve has at most K {\displaystyle K} descendants.

A rooted tree with the notions of parent, child, root, birthorder and wombmate shall be called a broodtree. Given a finite broodtree T {\displaystyle T} we say for each vertex that it survives or dies. A childless vertex survives. A vertex dies if and only if it has at least one brood all of whom survive. Let f ( c ) {\displaystyle f(c)} denote the probability that Eve survives in the broodtree T {\displaystyle T} given by the above process. The objective is to show lim c → ∞ f ( c ) = 0 {\displaystyle \lim _{c\rightarrow \infty }f(c)=0} and then for any fixed c {\displaystyle c} , it can be shown that lim ∗ f x , H ( c ) = f ( c ) {\displaystyle \lim ^{*}f_{x,H}(c)=f(c)} . These two relations complete our argument.

To show f ( c ) = 0 {\displaystyle f(c)=0} , let c ≥ 0 , Δ c > 0 {\displaystyle c\geq 0,\Delta c>0} . For Δ c {\displaystyle \Delta c} small, f ( c + Δ c ) − f ( c ) ≈ − ( Δ c ) f ( c ) Q + 1 {\displaystyle f(c+\Delta c)-f(c)\approx -(\Delta c)f(c)^{Q+1}} as, roughly, an Eve starting at time c + Δ c {\displaystyle c+\Delta c} might have a birth in time interval [ c , c + Δ c ) {\displaystyle [c,c+\Delta c)} all of whose children survive while Eve has no births in [ 0 , c ) {\displaystyle [0,c)} all of whose children survive. Letting Δ c → 0 {\displaystyle \Delta c\rightarrow 0} yields the differential equation f ′ ( c ) = − f ( c ) Q + 1 {\displaystyle f'(c)=-f(c)^{Q+1}} . The initial value f ( 0 ) = 1 {\displaystyle f(0)=1} gives a unique solution f ( c ) = ( 1 + Q c ) − 1 / Q {\displaystyle f(c)=(1+Qc)^{-1/Q}} . Note that indeed lim c → ∞ f ( c ) = 0 {\displaystyle \lim _{c\rightarrow \infty }f(c)=0} .

To prove lim ∗ f x , H ( c ) = f ( c ) {\displaystyle \lim ^{*}f_{x,H}(c)=f(c)} , consider a procedure we call History which either aborts or produces a broodtree. History contains a set T {\displaystyle T} of vertices, initially T = { x } {\displaystyle T=\{x\}} . T {\displaystyle T} will have a broodtree structure with x {\displaystyle x} the root. The y ∈ T {\displaystyle y\in T} are either processed or unprocessed, x {\displaystyle x} is initially unprocessed. To each y ∈ T {\displaystyle y\in T} is assigned a birthtime t y {\displaystyle t_{y}} , we initialize t x = c {\displaystyle t_{x}=c} . History is to take an unprocessed y ∈ T {\displaystyle y\in T} and process it as follows. For the value of all t E {\displaystyle t_{E}} with y ∈ E {\displaystyle y\in E} but with no x ∈ E {\displaystyle x\in E} that has already been processed, if either some E {\displaystyle E} has t E < t y {\displaystyle t_{E}<t_{y}} and y , z ∈ E {\displaystyle y,z\in E} with z ∈ T {\displaystyle z\in T} or some E , E ′ {\displaystyle E,E'} have t E , t E ′ < t y {\displaystyle t_{E},t_{E'}<t_{y}} with y ∈ E , E ′ {\displaystyle y\in E,E'} and | E ∪ E ′ | > 1 {\displaystyle |E\cup E'|>1} , then History is aborted. Otherwise for each E {\displaystyle E} with t E < t y {\displaystyle t_{E}<t_{y}} add all z ∈ E − { y } {\displaystyle z\in E-\{y\}} to T {\displaystyle T} as wombmates with parent y {\displaystyle y} and common birthdate t E {\displaystyle t_{E}} . Now y {\displaystyle y} is considered processed. History halts, if not aborted, when all y ∈ T {\displaystyle y\in T} are processed. If History does not abort then root x {\displaystyle x} survives broodtree T {\displaystyle T} if and only if x {\displaystyle x} survives at time c {\displaystyle c} . For a fixed broodtree, let f ( T , c ) {\displaystyle f(T,c)} denote the probability that the branching process yields broodtree T {\displaystyle T} . Then the probability that History does not abort is f ( T , c ) {\displaystyle f(T,c)} . By the finiteness of the branching process, ∑ f ( T , c ) = 1 {\displaystyle \sum f(T,c)=1} , the summation over all broodtrees T {\displaystyle T} and History does not abort. The l i m ∗ {\displaystyle lim^{*}} distribution of its broodtree approaches the branching process distribution. Thus lim ∗ f x , H ( c ) = f ( c ) {\displaystyle \lim ^{*}f_{x,H}(c)=f(c)} .

In 1985, Rödl proved Paul Erdős’s conjecture by a method called the Rödl nibble. Rödl's result can be formulated in form of either packing or covering problem. For 2 ≤ l < k < n {\displaystyle 2\leq l<k<n} the covering number denoted by M ( n , k , l ) {\displaystyle M(n,k,l)} shows the minimal size of a family κ {\displaystyle \kappa } of k {\displaystyle k} -element subsets of { 1 , . . . , n } {\displaystyle \{1,...,n\}} which have the property that every l {\displaystyle l} -element set is contained in at least one A ∈ κ {\displaystyle A\in \kappa } . Paul Erdős et al. conjecture was

lim n → ∞ M ( n , k , l ) ( n l ) / ( k l ) = 1 {\displaystyle \lim _{n\rightarrow \infty }{\frac {M(n,k,l)}{{n \choose l}/{k \choose l}}}=1} .

where 2 ≤ l < k {\displaystyle 2\leq l<k} . This conjecture roughly means that a tactical configuration is asymptotically achievable. One may similarly define the packing number m ( n , k , l ) {\displaystyle m(n,k,l)} as the maximal size of a family κ {\displaystyle \kappa } of k {\displaystyle k} -element subsets of { 1 , . . . , n } {\displaystyle \{1,...,n\}} having the property that every l {\displaystyle l} -element set is contained in at most one A ∈ κ {\displaystyle A\in \kappa } .

In 1997, Noga Alon, Jeong Han Kim, and Joel Spencer also supply a good bound for γ {\displaystyle \gamma } under the stronger codegree condition that every distinct pair v , v ′ ∈ V {\displaystyle v,v'\in V} has at most one edge in common.

For a k-uniform, D-regular hypergraph on n vertices, if k > 3, there exists a packing P covering all vertices but at most O ( n D − 1 / ( k − 1 ) ) {\displaystyle O(nD^{-1/(k-1)})} . If k = 3 there exists a packing P covering all vertices but at most O ( n D − 1 / 2 ln 3 / 2 ⁡ D ) {\displaystyle O(nD^{-1/2}\ln ^{3/2}D)} .

This bound is desirable in various applications, such as Steiner triple system. A Steiner Triple System is a 3-uniform, simple hypergraph in which every pair of vertices is contained in precisely one edge. Since a Steiner Triple System is clearly d=(n-1)/2-regular, the above bound supplies the following asymptotic improvement.

Any Steiner Triple System on n vertices contains a packing covering all vertices but at most O ( n 1 / 2 ln 3 / 2 ⁡ n ) {\displaystyle O(n^{1/2}\ln ^{3/2}n)} .

This has subsequently improved to n / 3 − O ( log ⁡ n log ⁡ log ⁡ n ) {\displaystyle n/3-O({\frac {\log n}{\log \log n}})} ^[1] and n − 4 3 {\displaystyle {\frac {n-4}{3}}} ^[2]

• Branching process
• Independent set
• Graph coloring
• Covering number
• Set packing
• Ramsey's theorem
• Set cover problem
• Sphere packing
• Steiner system
• Matching in hypergraphs