1. A central limit theorem for additive functionals of increasing trees. (8th March 2019) Authors: Ralaivaosaona, Dimbinaina; Wagner, Stephan Journal: Combinatorics, probability and computing Issue: Volume 28:Number 4(2019) Page Start: 618 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. A fast new algorithm for weak graph regularity. (3rd September 2019) Authors: Fox, Jacob; Lovász, László Miklós; Zhao, Yufei Journal: Combinatorics, probability and computing Issue: Volume 28:Number 5(2019) Page Start: 777 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. A fast new algorithm for weak graph regularity. (3rd September 2019) Authors: Fox, Jacob; Lovász, László Miklós; Zhao, Yufei Journal: Combinatorics, probability and computing Issue: Volume 28:Number 5(2019) Page Start: 777 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
4. A Linear Threshold for Uniqueness of Solutions to Random Jigsaw Puzzles. (8th January 2019) Authors: MARTINSSON, ANDERS Journal: Combinatorics, probability and computing Issue: Volume 28:Number 2(2019) Page Start: 287 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
5. 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) ↗
6. 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) ↗
7. A near-exponential improvement of a bound of Erdős and Lovász on maximal intersecting families. (4th September 2019) Authors: Frankl, Peter Journal: Combinatorics, probability and computing Issue: Volume 28:Number 5(2019) Page Start: 733 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
8. A near-exponential improvement of a bound of Erdős and Lovász on maximal intersecting families. (4th September 2019) Authors: Frankl, Peter Journal: Combinatorics, probability and computing Issue: Volume 28:Number 5(2019) Page Start: 733 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
9. Abelian Logic Gates. (13th March 2019) Authors: HOLROYD, ALEXANDER E.; LEVINE, LIONEL; WINKLER, PETER Journal: Combinatorics, probability and computing Issue: Volume 28:Number 3(2019) Page Start: 388 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
10. An asymptotic bound for the strong chromatic number. (15th September 2019) Authors: Lo, Allan; Sanhueza-Matamala, Nicolás Journal: Combinatorics, probability and computing Issue: Volume 28:Number 5(2019) Page Start: 768 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗