Content deleted Content added
Eunhuipark (talk | contribs) ←Created page with 'A packing in a hypergraph is to partition the set of its edges into a number of disjoint subsets such that no pair of edges in each subset share any vertex.…' |
Otisjimmy1 (talk | contribs) →Rödl nibble: clean up, typos fixed: et al → et al. using AWB |
||
Line 46:
==Rödl nibble==
In 1985, Rödl proved the [[Paul Erdős]]’s conjecture by a method called Rödl nibble. Rodl's result can be formulated in form of either packing or covering problem. For <math>2\leq l<k<n</math> the [[covering number]] denoted by <math>M(n,k,l)</math> shows the minimal size of a family <math>\kappa</math> of k-element subsets of <math>\{1,...,n\}</math> which have the property that every l-element set is contained in at least one <math>A \in \kappa</math>. [[Paul Erdős]] et al. conjecture was
:<math>\lim_{n\rightarrow \infty} \frac{M(n,k,l)}{{n \choose l}/{k \choose l}}=1</math>.
Line 140:
=External links=
* [http://www.cs.tau.ac.il/~nogaa/''Noga Alon's Hompage'']
* [http://research.microsoft.com/en-us/um/redmond/groups/theory/jehkim/''Jeong Han Kim's Homepage'']
| |||