1. 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) ↗
2. An Upper Bound on the Size of Avoidance Couplings. (11th December 2018) Authors: BATES, ERIK; SAUERMANN, LISA Journal: Combinatorics, probability and computing Issue: Volume 28:Number 3(2019) Page Start: 325 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. Decomposing Graphs into Edges and Triangles. (13th March 2019) Authors: KRÁL', DANIEL; LIDICKÝ, BERNARD; MARTINS, TAÍSA L.; PEHOVA, YANITSA Journal: Combinatorics, probability and computing Issue: Volume 28:Number 3(2019) Page Start: 465 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
4. Inversions in Split Trees and Conditional Galton–Watson Trees. (31st October 2018) Authors: CAI, XING SHI; HOLMGREN, CECILIA; JANSON, SVANTE; JOHANSSON, TONY; SKERMAN, FIONA Journal: Combinatorics, probability and computing Issue: Volume 28:Number 3(2019) Page Start: 335 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
5. On a Problem of Danzer. (15th October 2018) Authors: MUSTAFA, NABIL H.; RAY, SAURABH Journal: Combinatorics, probability and computing Issue: Volume 28:Number 3(2019) Page Start: 473 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
6. Polynomial Mixing of the Edge-Flip Markov Chain for Unbiased Dyadic Tilings. (31st October 2018) Authors: CANNON, S.; LEVIN, D. A.; STAUFFER, A. Journal: Combinatorics, probability and computing Issue: Volume 28:Number 3(2019) Page Start: 365 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
7. Sparse Highly Connected Spanning Subgraphs in Dense Directed Graphs. (5th November 2018) Authors: KANG, DONG YEAP Journal: Combinatorics, probability and computing Issue: Volume 28:Number 3(2019) Page Start: 423 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗