Journal: Combinatorics, Probability & Computing

Volume 34, Issue 4

486 -- 490Shengtong Zhang. Hypergraph independence polynomials with a zero close to the origin
491 -- 527Konstantinos Panagiotou, Matija Pasch. Satisfiability thresholds for regular occupation problems
528 -- 544Luis Ferroni, Benjamin Schröter. Face enumeration for split matroid polytopes
545 -- 558Patrick Bennett, Calum MacRury. Extending Wormald's differential equation method to one-sided bounds
559 -- 564Micha Christoph, Kalina Petrova, Raphael Steiner. A note on digraph splitting
565 -- 584Lior Gishboliner, Stefan Glock, Amedeo Sgueglia. Tight Hamilton cycles with high discrepancy
585 -- 595Boris Bukh, Michael Krivelevich, Bhargav Narayanan. Colouring random subgraphs
596 -- 620Asaf Ferber, Jie Han 0002, Dingjia Mao, Roman Vershynin. Hamiltonicity of sparse pseudorandom graphs

Volume 34, Issue 3

326 -- 337Lisa Sauermann, Zixuan Xu. Essential covers of the hypercube require many hyperplanes
338 -- 358Grzegorz Adamski, Sylwia Antoniuk, Malgorzata Bednarska-Bzdega, Dennis Clemens, Fabian Hamann, Yannick Mogge. Tree universality in positional games
359 -- 391Andreas Galanis, Leslie Ann Goldberg, Paulina Smolarova. Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics
392 -- 400David Hartman, Tomás Hons, Jaroslav Nesetril. Structural convergence and algebraic roots
401 -- 420Kevin Hendrey, Sergey Norin, Raphael Steiner, Jérémie Turcotte. Twin-width of sparse random graphs
421 -- 444HyunWoo Lee. On perfect subdivision tilings
445 -- 485Simone Baldassarri, Vanessa Jacquier, Alessandro Zocca. Critical configurations of the hard-core model on square grid graphs

Volume 34, Issue 2

158 -- 209Matthew Dickson, Markus Heydenreich. Expansion of the critical intensity for the random connection model
210 -- 258Amin Coja-Oghlan, Max Hahn-Klimroth, Lukas Hintze, Dominik Kaaser, Lena Krieg, Maurice Rolvien, Olga Scheftelowitsch. Noisy group testing via spatial coupling
259 -- 275Charilaos Efthymiou 0001, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda. Optimal mixing via tensorization for random independent sets on arbitrary trees
276 -- 282Nemanja Draganic, Peter Keevash. Long induced paths in expanders
283 -- 297Daniel Altman, Zachary Chase 0003. On the smallest gap in a sequence with Poisson pair correlations
298 -- 320Simona Boyadzhiyska, Dennis Clemens, Shagnik Das, Pranshu Gupta. Ramsey simplicity of random graphs
321 -- 325Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin. Tight bound for the Erdős-Pósa property of tree minors

Volume 34, Issue 1

1 -- 51Ioana Dumitriu, Hai-Xiao Wang, Yizhe Zhu. Partial recovery and weak consistency in the non-uniform hypergraph stochastic block model
52 -- 62Xizhi Liu, Oleg Pikhurko. A note on extremal constructions for the Erdős-Rademacher problem
63 -- 89Tobias Friedrich 0001, Andreas Göbel 0001, Maximilian Katzmann, Martin S. Krejca, Marcus Pappik. Sampling repulsive Gibbs point processes using random graphs
90 -- 114Johan Björklund, Cecilia Holmgren, Svante Janson, Tiffany Y. Y. Lo. Approximation of subgraph counts in the uniform attachment model
115 -- 130Pu Gao, Yuval Ohapkin. Embedding theorems for random graphs with specified degrees
131 -- 150Alexander Van Werde. Cokernel statistics for walk matrices of directed and weighted random graphs
151 -- 157Anders Martinsson, Raphael Steiner. Vertex-critical graphs far from edge-criticality