Journal: Combinatorics, Probability & Computing

Volume 31, Issue 3

368 -- 410Gabriel Berzunza Ojeda, Svante Janson. The distance profile of rooted and unrooted simply generated trees
411 -- 429Matthew Coulson. The critical window in random digraphs
430 -- 454Markus Heydenreich, Kilian Matzke. Expansion for the critical point of site percolation: the first three terms
455 -- 477Asaf Ferber, Vishesh Jain, Yufei Zhao. On the number of Hadamard matrices via anti-concentration
478 -- 488Andrea Freschi, Joseph Hyde, Andrew Treglown. On deficiency problems for graphs
489 -- 506Maria Axenovich, António Girão, Richard Snyder, Lea Weber. Strong complete minors in digraphs
507 -- 549Rémi Cocou Avohou, Joseph Ben Geloun, Mahouton Norbert Hounkonnou. Extending the Tutte and Bollobás-Riordan polynomials to rank 3 weakly coloured stranded graphs