Comb. Probab. Comput.

Keyphrases

Publications

volume 33, number 1, 2024

Vida Dujmovic, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
The Excluded Tree Minor Theorem Revisited. Comb. Probab. Comput. 33 (1) (2024)
Andrzej Grzesik, Daniel Král', Oleg Pikhurko
Forcing generalised quasirandom graphs efficiently. Comb. Probab. Comput. 33 (1) (2024)
David J. Galvin, Gwen McKinley, Will Perkins, Michail Sarantis, Prasad Tetali
On the zeroes of hypergraph independence polynomials. Comb. Probab. Comput. 33 (1) (2024)
Piet Lammers, Fabio Lucio Toninelli
Height function localisation on trees. Comb. Probab. Comput. 33 (1) (2024)
Matthew Jenssen, Marcus Michelen, Mohan Ravichandran
Quasipolynomial-time algorithms for Gibbs point processes. Comb. Probab. Comput. 33 (1) (2024)
Dmitrii Zakharov
On the size of maximal intersecting families. Comb. Probab. Comput. 33 (1) (2024)
Stijn Cambie, Jun Gao, Hong Liu
Many Hamiltonian subsets in large graphs with given density. Comb. Probab. Comput. 33 (1) (2024)
Matías Pavez-Signé
Spanning subdivisions in Dirac graphs. Comb. Probab. Comput. 33 (1) (2024)
Peter Frankl, Jian Wang
Intersecting families without unique shadow. Comb. Probab. Comput. 33 (1) (2024)

volume 33, number 2, 2024

volume 33, number 3, 2024

volume 32, number 3, 2023

David Conlon, Jacob Fox, Yuval Wigderson
Off-diagonal book Ramsey numbers. 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)

volume 32, number 4, 2023

volume 32, number 5, 2023

Anurag Bishnoi, Simona Boyadzhiyska, Shagnik Das, Tamás Mészáros
Subspace coverings with multiplicities. Comb. Probab. Comput. 32 (5) (2023)
Alberto Espuny Díaz, Yury Person
Spanning -cycles in random graphs. Comb. Probab. Comput. 32 (5) (2023)
Dingding Dong, Nitya Mani, Yufei Zhao
On the number of error correcting codes. Comb. Probab. Comput. 32 (5) (2023)
Nina Kamcev, Alp Müyesser
Unavoidable patterns in locally balanced colourings. Comb. Probab. Comput. 32 (5) (2023)
Ander Lamaison
Ramsey upper density of infinite graphs. Comb. Probab. Comput. 32 (5) (2023)
Fabrizio Frati, Michael Hoffmann, Csaba D. Tóth
Universal geometric graphs. Comb. Probab. Comput. 32 (5) (2023)
Bjarne Schülke
A pair degree condition for Hamiltonian cycles in 3-uniform hypergraphs. Comb. Probab. Comput. 32 (5) (2023)
Sam Spiro
A smoother notion of spread hypergraphs. Comb. Probab. Comput. 32 (5) (2023)
Lior Gishboliner, Benny Sudakov
Maximal chordal subgraphs. Comb. Probab. Comput. 32 (5) (2023)

volume 32, number 6, 2023