default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorics, Probability & Computing, Volume 33
Volume 33, Number 1, January 2024
- Matthew Jenssen
, Marcus Michelen, Mohan Ravichandran:
Quasipolynomial-time algorithms for Gibbs point processes. 1-15 - Andrzej Grzesik, Daniel Král', Oleg Pikhurko:
Forcing generalised quasirandom graphs efficiently. 16-31 - Dmitrii Zakharov:
On the size of maximal intersecting families. 32-49 - Piet Lammers, Fabio Lucio Toninelli:
Height function localisation on trees. 50-64 - David J. Galvin, Gwen McKinley, Will Perkins, Michail Sarantis, Prasad Tetali:
On the zeroes of hypergraph independence polynomials. 65-84 - Vida Dujmovic, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood:
The Excluded Tree Minor Theorem Revisited. 85-90 - Peter Frankl, Jian Wang:
Intersecting families without unique shadow. 91-109 - Stijn Cambie, Jun Gao, Hong Liu:
Many Hamiltonian subsets in large graphs with given density. 110-120 - Matías Pavez-Signé:
Spanning subdivisions in Dirac graphs. 121-128
Volume 33, Number 2, March 2024
- Olivier Fischer, Raphael Steiner:
On the choosability of -minor-free graphs. 129-142 - Anders Martinsson, Pascal Su:
Mastermind with a linear number of queries. 143-156 - Igor Araujo, József Balogh, Robert A. Krueger, Simón Piga, Andrew Treglown:
On oriented cycles in randomly perturbed digraphs. 157-178 - Tom Kelly, Daniela Kühn, Deryk Osthus:
A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree. 179-195 - Lampros Gavalakis:
Approximate discrete entropy monotonicity for log-concave sums. 196-209 - Yassine El Maazouz, Jim Pitman:
The Bernoulli clock: probabilistic and combinatorial interpretations of the Bernoulli polynomials by circular convolution. 210-237 - Noe Kawamoto, Akira Sakai:
Spread-out limit of the critical points for lattice trees and lattice animals in dimensions. 238-269
Volume 33, Number 3, 2024
- Jie Han, Jie Hu, Lidan Ping, Guanghui Wang, Yi Wang, Donglei Yang:
Spanning trees in graphs without large bipartite holes. 270-285 - Maria Axenovich, Domagoj Bradac, Lior Gishboliner, Dhruv Mubayi, Lea Weber:
Large cliques or cocliques in hypergraphs with forbidden order-size pairs. 286-299 - Grigoriy Blekherman, Shyamal Patel:
Threshold graphs maximise homomorphism densities. 300-318 - Mario Correddu, Dario Trevisan:
On minimum spanning trees for random Euclidean bipartite graphs. 319-350 - Rutger Campbell, Katie Clinch, Marc Distel, J. Pascal Gollin, Kevin Hendrey, Robert Hickingbotham, Tony Huynh, Freddie Illingworth, Youri Tamitegama, Jane Tan, David R. Wood:
Product structure of graph classes with bounded treewidth. 351-376 - Sahar Diskin, Joshua Erde, Mihyun Kang, Michael Krivelevich:
Percolation on irregular high-dimensional product graphs. 377-403 - Maria Axenovich:
A class of graphs of zero Turán density in a hypercube. 404-410
Volume 33, Number 4, 2024
- Jacob Fox, Sammy Luo, Huy Tuan Pham, Yunkun Zhou:
Small subsets with large sumset: Beyond the Cauchy-Davenport bound. 411-431 - Chunchao Fan, Qizhong Lin, Yuanhui Yan:
On a conjecture of Conlon, Fox, and Wigderson. 432-445 - Maya Stein, Camila Zárate-Guerén:
Antidirected subgraphs of oriented graphs. 446-466 - Deepak Bal, Louis DeBiasio:
Large monochromatic components in expansive hypergraphs. 467-483 - Peter van Hintum, Peter Keevash:
Sharp bounds for a discrete John's theorem. 484-486 - Charlie Carlson, Ewan Davies, Nicolas Fraiman, Alexandra Kolla, Aditya Potukuchi, Corrine Yap:
Algorithms for the ferromagnetic Potts model on expanders. 487-517 - Clemens Heuberger, Sarah J. Selkirk, Stephan Wagner:
The distribution of the maximum protection number in simply generated trees. 518-553
Volume 33, Number 5, 2024
- Nemanja Draganic, David Munhá Correia, Benny Sudakov:
A generalization of Bondy's pancyclicity theorem. 554-563 - Jakob Hofstad:
Behaviour of the minimum degree throughout the ${\textit{d}}$ -process. 564-582 - Xizhi Liu, Dhruv Mubayi, David Munhá Correia:
Turán problems in pseudorandom graphs. 583-596 - Svante Janson, Paul Thévenin:
Central limit theorem for components in meandric systems through high moments. 597-610 - Michael Krivelevich, Maksim Zhukovskii:
Maximum chordal subgraphs of random graphs. 611-623 - Kyriakos Katsamaktsis, Shoham Letzter, Amedeo Sgueglia:
Rainbow Hamiltonicity in uniformly coloured perturbed digraphs. 624-642 - Amin Coja-Oghlan, Pu Gao, Max Hahn-Klimroth, Joon Lee, Noëla Müller, Maurice Rolvien:
The full rank condition for sparse random matrices. 643-707
Volume 33, Number 6, 2024
- Omer Israeli, Yuval Peled:
Noise sensitivity of the minimum spanning tree of the complete graph. 708-723 - Asaf Shapira:
A generalisation of Varnavides's theorem. 724-728 - Richard Montgomery, Matías Pavez-Signé:
Counting spanning subgraphs in dense hypergraphs. 729-741 - Marcelo Tadeu Sales:
On the Ramsey numbers of daisies II. 742-768 - Robin Houston, Adam P. Goucher, Nathaniel Johnston:
A new formula for the determinant and bounds on its tensor and Waring ranks. 769-794 - Pavel Pudlák, Vojtech Rödl, Marcelo Tadeu Sales:
On the Ramsey numbers of daisies I. 795-806 - Stijn Cambie, Wouter Cames van Batenburg, Ewan Davies, Ross J. Kang:
List packing number of bounded degree graphs. 807-828 - Eden Kuperwasser, Wojciech Samotij:
The List-Ramsey threshold for families of graphs. 829-851
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.
last updated on 2025-06-16 22:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
