


default search action
Combinatorics, Probability & Computing, Volume 34
Volume 34, Number 1, 2025
- Ioana Dumitriu, Haixiao Wang
, Yizhe Zhu:
Partial recovery and weak consistency in the non-uniform hypergraph stochastic block model. 1-51 - Xizhi Liu, Oleg Pikhurko:
A note on extremal constructions for the Erdős-Rademacher problem. 52-62 - Tobias Friedrich
, Andreas Göbel
, Maximilian Katzmann, Martin S. Krejca
, Marcus Pappik:
Sampling repulsive Gibbs point processes using random graphs. 63-89 - Johan Björklund, Cecilia Holmgren, Svante Janson
, Tiffany Y. Y. Lo
:
Approximation of subgraph counts in the uniform attachment model. 90-114 - Pu Gao, Yuval Ohapkin:
Embedding theorems for random graphs with specified degrees. 115-130 - Alexander Van Werde
:
Cokernel statistics for walk matrices of directed and weighted random graphs. 131-150 - Anders Martinsson, Raphael Steiner
:
Vertex-critical graphs far from edge-criticality. 151-157
Volume 34, Number 2, 2025
- Matthew Dickson
, Markus Heydenreich
:
Expansion of the critical intensity for the random connection model. 158-209 - Amin Coja-Oghlan
, Max Hahn-Klimroth, Lukas Hintze, Dominik Kaaser, Lena Krieg
, Maurice Rolvien, Olga Scheftelowitsch:
Noisy group testing via spatial coupling. 210-258 - Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda:
Optimal mixing via tensorization for random independent sets on arbitrary trees. 259-275 - Nemanja Draganic
, Peter Keevash:
Long induced paths in expanders. 276-282 - Daniel Altman, Zachary Chase:
On the smallest gap in a sequence with Poisson pair correlations. 283-297 - Simona Boyadzhiyska
, Dennis Clemens
, Shagnik Das
, Pranshu Gupta
:
Ramsey simplicity of random graphs. 298-320 - Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin:
Tight bound for the Erdős-Pósa property of tree minors. 321-325
Volume 34, Number 3, 2025
- Lisa Sauermann, Zixuan Xu:
Essential covers of the hypercube require many hyperplanes. 326-337 - Grzegorz Adamski
, Sylwia Antoniuk
, Malgorzata Bednarska-Bzdega
, Dennis Clemens
, Fabian Hamann
, Yannick Mogge
:
Tree universality in positional games. 338-358 - Andreas Galanis
, Leslie Ann Goldberg
, Paulina Smolarova
:
Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics. 359-391 - David Hartman
, Tomás Hons
, Jaroslav Nesetril
:
Structural convergence and algebraic roots. 392-400 - Kevin Hendrey, Sergey Norin, Raphael Steiner
, Jérémie Turcotte
:
Twin-width of sparse random graphs. 401-420 - Hyunwoo Lee:
On perfect subdivision tilings. 421-444 - Simone Baldassarri
, Vanessa Jacquier
, Alessandro Zocca
:
Critical configurations of the hard-core model on square grid graphs. 445-485
Volume 34, Number 4, 2025
- Shengtong Zhang
:
Hypergraph independence polynomials with a zero close to the origin. 486-490 - Konstantinos Panagiotou
, Matija Pasch
:
Satisfiability thresholds for regular occupation problems. 491-527 - Luis Ferroni
, Benjamin Schröter
:
Face enumeration for split matroid polytopes. 528-544 - Patrick Bennett
, Calum MacRury:
Extending Wormald's differential equation method to one-sided bounds. 545-558 - Micha Christoph, Kalina Petrova, Raphael Steiner
:
A note on digraph splitting. 559-564 - Lior Gishboliner
, Stefan Glock, Amedeo Sgueglia
:
Tight Hamilton cycles with high discrepancy. 565-584 - Boris Bukh
, Michael Krivelevich
, Bhargav Narayanan:
Colouring random subgraphs. 585-595 - Asaf Ferber, Jie Han, Dingjia Mao
, Roman Vershynin:
Hamiltonicity of sparse pseudorandom graphs. 596-620

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.