1. A greedy algorithm for finding a large 2‐matching on a random cubic graph. Issue 3 (27th November 2017) Authors: Bal, Deepak; Bennett, Patrick; Bohman, Tom; Frieze, Alan Journal: Journal of graph theory Issue: Volume 88:Issue 3(2018) Page Start: 449 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. A natural barrier in random greedy hypergraph matching. (27th June 2019) Authors: Bennett, Patrick; Bohman, Tom Journal: Combinatorics, probability and computing Issue: Volume 28:Number 6(2019) Page Start: 816 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. A natural barrier in random greedy hypergraph matching. (27th June 2019) Authors: Bennett, Patrick; Bohman, Tom Journal: Combinatorics, probability and computing Issue: Volume 28:Number 6(2019) Page Start: 816 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
4. A note on the random greedy independent set algorithm1. Issue 3 (3rd August 2016) Authors: Bennett, Patrick; Bohman, Tom Journal: Random structures & algorithms Issue: Volume 49:Issue 3(2016) Page Start: 479 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
5. Coprime mappings and lonely runners. Issue 3 (11th May 2022) Authors: Bohman, Tom; Peng, Fei Journal: Mathematika Issue: Volume 68:Issue 3(2022) Page Start: 784 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
6. Dynamic concentration of the triangle‐free process. Issue 2 (17th November 2020) Authors: Bohman, Tom; Keevash, Peter Journal: Random structures & algorithms Issue: Volume 58:Issue 2(2021) Page Start: 221 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
7. Independent sets in hypergraphs omitting an intersection. Issue 3 (14th December 2021) Authors: Bohman, Tom; Liu, Xizhi; Mubayi, Dhruv Journal: Random structures & algorithms Issue: Volume 61:Issue 3(2022) Page Start: 493 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
8. More on the Bipartite Decomposition of Random Graphs. Issue 1 (22nd February 2016) Authors: Alon, Noga; Bohman, Tom; Huang, Hao Journal: Journal of graph theory Issue: Volume 84:Issue 1(2017) Page Start: 45 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗