Sign in
Comb. Probab. Comput.
1992
2002
2013
2023
1992
2023
Keyphrases
Publications
volume 32, number 1, 2023
Tereza Klimosová
,
Christian Reiher
,
Andrzej Rucinski
,
Matas Sileikis
Sandwiching biregular random graphs.
Comb. Probab. Comput.
32 (1) (2023)
James Anderson
,
Anton Bernshteyn
,
Abhishek Dhawan
Colouring graphs with forbidden bipartite subgraphs.
Comb. Probab. Comput.
32 (1) (2023)
András Mészáros
A BK inequality for random matchings.
Comb. Probab. Comput.
32 (1) (2023)
Luc Devroye
,
Marcel K. Goh
,
Rosie Y. Zhao
On the peel number and the leaf-height of Galton-Watson trees.
Comb. Probab. Comput.
32 (1) (2023)
Sergey Norin
,
Alex Scott
,
David R. Wood
Clustered colouring of graph classes with bounded treedepth or pathwidth.
Comb. Probab. Comput.
32 (1) (2023)
Tao Jiang
,
Yu Qiu
Many Turán exponents via subdivisions.
Comb. Probab. Comput.
32 (1) (2023)
David de Boer
,
Pjotr Buys
,
Guus Regts
Uniqueness of the Gibbs measure for the 4-state anti-ferromagnetic Potts model on the regular tree.
Comb. Probab. Comput.
32 (1) (2023)
Julia Böttcher
,
Olaf Parczyk
,
Amedeo Sgueglia
,
Jozef Skokan
Triangles in randomly perturbed graphs.
Comb. Probab. Comput.
32 (1) (2023)
volume 32, number 2, 2023
Luka Milicevic
Approximately symmetric forms far from being exactly symmetric.
Comb. Probab. Comput.
32 (2) (2023)
Alex Cameron
,
Emily Heath
New upper bounds for the Erdős-Gyárfás problem on generalized Ramsey numbers.
Comb. Probab. Comput.
32 (2) (2023)
Catherine S. Greenhill
,
Mikhail Isaev
,
Tamás Makai
,
Brendan D. McKay
Degree sequences of sufficiently dense random uniform hypergraphs.
Comb. Probab. Comput.
32 (2) (2023)
Raphael Steiner
Improved bound for improper colourings of graphs with no odd clique minor.
Comb. Probab. Comput.
32 (2) (2023)
Joseph Hyde
Towards the 0-statement of the Kohayakawa-Kreuter conjecture.
Comb. Probab. Comput.
32 (2) (2023)
Noga Alon
,
Fan Wei
Irregular subgraphs.
Comb. Probab. Comput.
32 (2) (2023)
Asaf Ferber
,
Ashwin Sah
,
Mehtaab Sawhney
,
Yizhe Zhu
Sparse recovery properties of discrete random matrices.
Comb. Probab. Comput.
32 (2) (2023)
Bogdan Nica
Polynomials over structured grids.
Comb. Probab. Comput.
32 (2) (2023)
Lucas Boczkowski
,
Igor Shinkar
On mappings on the hypercube with small average stretch.
Comb. Probab. Comput.
32 (2) (2023)
volume 32, number 3, 2023
James Foster
,
Karen Habermann
Brownian bridge expansions for Lévy area approximations and particular values of the Riemann zeta function.
Comb. Probab. Comput.
32 (3) (2023)
Tom Hutchcroft
,
Alexander Kent
,
Petar Nizic-Nikolac
The bunkbed conjecture holds in the p\uparrow 1 limit.
Comb. Probab. Comput.
32 (3) (2023)
Sahar Diskin
,
Michael Krivelevich
Supercritical site percolation on the hypercube: small components are small.
Comb. Probab. Comput.
32 (3) (2023)
David Conlon
,
Jacob Fox
,
Yuval Wigderson
Off-diagonal book Ramsey numbers.
Comb. Probab. Comput.
32 (3) (2023)
Elvira Moreno
,
Mauricio Velasco
On random walks and switched random walks on homogeneous spaces.
Comb. Probab. Comput.
32 (3) (2023)
George Andriopoulos
Convergence of blanket times for sequences of random walks on critical random graphs.
Comb. Probab. Comput.
32 (3) (2023)
Bhaswar B. Bhattacharya
,
Anirban Chatterjee
,
Svante Janson
Fluctuations of subgraph counts in graphon based random graphs.
Comb. Probab. Comput.
32 (3) (2023)
Eoin Long
,
Laurentiu Ploscaru
A bipartite version of the Erdős-McKay conjecture.
Comb. Probab. Comput.
32 (3) (2023)
volume 31, number 3, 2022
Gabriel Berzunza Ojeda
,
Svante Janson
The distance profile of rooted and unrooted simply generated trees.
Comb. Probab. Comput.
31 (3) (2022)
Matthew Coulson
The critical window in random digraphs.
Comb. Probab. Comput.
31 (3) (2022)
volume 31, number 4, 2022
Lowell Abrams
,
Joanna A. Ellis-Monaghan
New dualities from old: generating geometric, Petrie, and Wilson dualities and trialities of ribbon graphs.
Comb. Probab. Comput.
31 (4) (2022)
Jacob Fox
,
Yufei Zhao
Removal lemmas and approximate homomorphisms.
Comb. Probab. Comput.
31 (4) (2022)
Vojtech Rödl
,
Marcelo Tadeu Sales
A blurred view of Van der Waerden type theorems.
Comb. Probab. Comput.
31 (4) (2022)
Vishesh Jain
,
Ashwin Sah
,
Mehtaab Sawhney
On the smallest singular value of symmetric random matrices.
Comb. Probab. Comput.
31 (4) (2022)
Alejandro H. Morales
,
Igor Pak
,
Martin Tassy
Asymptotics for the number of standard tableaux of skew shape and for weighted lozenge tilings.
Comb. Probab. Comput.
31 (4) (2022)
Peter Allen
,
Julia Böttcher
,
Julia Ehrenmüller
,
Jakob Schnitzer
,
Anusch Taraz
A spanning bandwidth theorem in random graphs.
Comb. Probab. Comput.
31 (4) (2022)
Matthew Jenssen
,
Will Perkins
,
Aditya Potukuchi
Independent sets of a given size and structure in the hypercube.
Comb. Probab. Comput.
31 (4) (2022)
Markus Kuba
,
Alois Panholzer
On bucket increasing trees, clustered increasing trees and increasing diamonds.
Comb. Probab. Comput.
31 (4) (2022)
volume 31, number 5, 2022
Mikhail Isaev
,
Angus Southwell
,
Maksim Zhukovskii
Distribution of tree parameters by martingale approach.
Comb. Probab. Comput.
31 (5) (2022)
Tony Huynh
,
Gwenaël Joret
,
David R. Wood
Subgraph densities in a surface.
Comb. Probab. Comput.
31 (5) (2022)
Maciej Bendkowski
,
Olivier Bodini
,
Sergey Dovgal
Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers.
Comb. Probab. Comput.
31 (5) (2022)
Andrzej Grzesik
,
Joonkyung Lee
,
Bernard Lidický
,
Jan Volec
On tripartite common graphs.
Comb. Probab. Comput.
31 (5) (2022)
Umberto De Ambroggio
,
Matthew I. Roberts
Unusually large components in near-critical Erdős-Rényi graphs via ballot theorems.
Comb. Probab. Comput.
31 (5) (2022)
Nemanja Draganic
,
Stefan Glock
,
Michael Krivelevich
Short proofs for long induced paths.
Comb. Probab. Comput.
31 (5) (2022)
Ivailo Hartarsky
,
Laure Marêché
Refined universality for critical KCM: lower bounds.
Comb. Probab. Comput.
31 (5) (2022)
volume 31, number 6, 2022
Noga Alon
,
Asaf Nachmias
,
Matan Shalev
The diameter of the uniform spanning tree of dense graphs.
Comb. Probab. Comput.
31 (6) (2022)
Freddie Illingworth
The chromatic profile of locally colourable graphs.
Comb. Probab. Comput.
31 (6) (2022)
Ronen Eldan
,
Dan Mikulincer
,
Hester Pieters
Community detection and percolation of information in a geometric setting.
Comb. Probab. Comput.
31 (6) (2022)
Beka Ergemlidze
,
Theodore Molla
Transversal Ck-factors in subgraphs of the balanced blow-up of Ck.
Comb. Probab. Comput.
31 (6) (2022)
Raphael Steiner
Improved lower bound for the list chromatic number of graphs with no Kt minor.
Comb. Probab. Comput.
31 (6) (2022)
Antonio Blanca
,
Alistair Sinclair
,
Xusheng Zhang
The critical mean-field Chayes-Machta dynamics.
Comb. Probab. Comput.
31 (6) (2022)
Allan Lo
,
Andrew Treglown
,
Yi Zhao
Complete subgraphs in a multipartite graph.
Comb. Probab. Comput.
31 (6) (2022)
Xizhi Liu
Hypergraphs without non-trivial intersecting subgraphs.
Comb. Probab. Comput.
31 (6) (2022)