论文信息 - Dependent Sets of Constant Weight Binary Vectors - 字舞流文

Dependent Sets of Constant Weight Binary Vectors

We determine lower bounds for the number of random binary vectors, chosen uniformly from vectors of weight k, needed to obtain a dependent set.

[1] P. Diaconis. Group representations in probability and statistics , 1988 .

[2] B. Bollobás. The evolution of random graphs , 1984 .

[3] V. F. Kolchin,et al. Hypercycles in a random hypergraph , 1992 .

[4] P. Erdos,et al. On the evolution of random graphs , 1984 .

[5] Ronald L. Graham,et al. Asymptotic Analysis of a Random Walk on a Hypercube with Many Dimensions , 1990, Random Struct. Algorithms.