- Svante Janson:
Random Recursive Trees and Preferential Attachment Trees are Random Split Trees. Comb. Probab. Comput. 28(1): 81-99 (2019) - Ramin Javadi
, Farideh Khoeini, G. R. Omidi, Alexey Pokrovskiy:
On the Size-Ramsey Number of Cycles. Comb. Probab. Comput. 28(6): 871-880 (2019) - Dong Yeap Kang:
Sparse Highly Connected Spanning Subgraphs in Dense Directed Graphs. Comb. Probab. Comput. 28(3): 423-464 (2019) - Dong Yeap Kang, Sang-il Oum:
Improper colouring of graphs with no odd clique minor. Comb. Probab. Comput. 28(5): 740-754 (2019) - Daniel Král', Bernard Lidický, Taísa L. Martins, Yanitsa Pehova:
Decomposing Graphs into Edges and Triangles. Comb. Probab. Comput. 28(3): 465-472 (2019) - Markus Kuba, Alois Panholzer:
Combinatorial Analysis of Growth Models for Series-Parallel Networks. Comb. Probab. Comput. 28(4): 574-599 (2019) - Andrey Kupavskii, Nabil H. Mustafa, Konrad J. Swanepoel:
Bounding the Size of an Almost-Equidistant Set in Euclidean Space. Comb. Probab. Comput. 28(2): 280-286 (2019) - Jiange Li, Mokshay Madiman:
A Combinatorial Approach to Small Ball Inequalities for Sums and Differences. Comb. Probab. Comput. 28(1): 100-129 (2019) - Svante Linusson:
Erratum to 'On Percolation and the Bunkbed Conjecture'. Comb. Probab. Comput. 28(6): 917-918 (2019) - Allan Lo, Nicolás Sanhueza-Matamala:
An asymptotic bound for the strong chromatic number. Comb. Probab. Comput. 28(5): 768-776 (2019) - Anders Martinsson:
A Linear Threshold for Uniqueness of Solutions to Random Jigsaw Puzzles. Comb. Probab. Comput. 28(2): 287-302 (2019) - Katalin Marton:
Logarithmic Sobolev inequalities in discrete product spaces. Comb. Probab. Comput. 28(6): 919-935 (2019) - Dhruv Mubayi, Caroline Terry:
An Extremal Graph Problem with a Transcendental Solution. Comb. Probab. Comput. 28(2): 303-324 (2019) - Nabil H. Mustafa, Saurabh Ray:
On a Problem of Danzer. Comb. Probab. Comput. 28(3): 473-482 (2019) - Patricio V. Poblete, Alfredo Viola:
Analysis of Robin Hood and Other Hashing Algorithms Under the Random Probing Model, With and Without Deletions. Comb. Probab. Comput. 28(4): 600-617 (2019) - Dimbinaina Ralaivaosaona, Stephan G. Wagner:
A central limit theorem for additive functionals of increasing trees. Comb. Probab. Comput. 28(4): 618-637 (2019) - Vonjy Rasendrahasina, Andry Rasoanaivo, Vlady Ravelomanana:
Expected Maximum Block Size in Critical Random Graphs. Comb. Probab. Comput. 28(4): 638-655 (2019) - Felicia Raßmann:
On the Number of Solutions in Random Graph k-Colouring. Comb. Probab. Comput. 28(1): 130-158 (2019) - Andrew J. Uzzell:
An Improved Upper Bound for Bootstrap Percolation in All Dimensions. Comb. Probab. Comput. 28(6): 936-960 (2019)
