The longest chain among random points in euclidean space
Abstract
Let n random points be chosen independently from the uniform distribution on the unit k-cube [0, 1]k. Order the points coordinate-wise and let Hk(n) be the cardinality of the largest chain in the resulting partially ordered set. We show that there are constants C1, C2,… such that ck
Publication Title
Proceedings of the American Mathematical Society
Recommended Citation
Bollobás, B., & Winkler, P. (1988). The longest chain among random points in euclidean space. Proceedings of the American Mathematical Society, 103 (2), 347-353. https://doi.org/10.1090/S0002-9939-1988-0943043-6
COinS
