Patrick Bennett, Tom Bohman. A natural barrier in random greedy hypergraph matching. Combinatorics, Probability & Computing, 28(6):816-825, 2019. [doi]
@article{BennettB19,
title = {A natural barrier in random greedy hypergraph matching},
author = {Patrick Bennett and Tom Bohman},
year = {2019},
doi = {10.1017/S0963548319000051},
url = {https://doi.org/10.1017/S0963548319000051},
researchr = {https://researchr.org/publication/BennettB19},
cites = {0},
citedby = {0},
journal = {Combinatorics, Probability & Computing},
volume = {28},
number = {6},
pages = {816-825},
}