default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorics, Probability & Computing, Volume 32
Volume 32, Number 1, January 2023
Paper
- Tereza Klimosová
, Christian Reiher, Andrzej Rucinski, Matas Sileikis:
Sandwiching biregular random graphs. 1-44 - James Anderson, Anton Bernshteyn, Abhishek Dhawan:
Colouring graphs with forbidden bipartite subgraphs. 45-67 - Luc Devroye, Marcel K. Goh, Rosie Y. Zhao:
On the peel number and the leaf-height of Galton-Watson trees. 68-90 - Julia Böttcher, Olaf Parczyk, Amedeo Sgueglia, Jozef Skokan:
Triangles in randomly perturbed graphs. 91-121 - Sergey Norin, Alex Scott, David R. Wood:
Clustered colouring of graph classes with bounded treedepth or pathwidth. 122-133 - Tao Jiang, Yu Qiu:
Many Turán exponents via subdivisions. 134-150 - András Mészáros:
A BK inequality for random matchings. 151-157 - David de Boer, Pjotr Buys, Guus Regts:
Uniqueness of the Gibbs measure for the 4-state anti-ferromagnetic Potts model on the regular tree. 158-182
Volume 32, Number 2, March 2023
Paper
- Catherine S. Greenhill, Mikhail Isaev, Tamás Makai, Brendan D. McKay:
Degree sequences of sufficiently dense random uniform hypergraphs. 183-224 - Joseph Hyde:
Towards the 0-statement of the Kohayakawa-Kreuter conjecture. 225-268 - Noga Alon, Fan Wei:
Irregular subgraphs. 269-283 - Bogdan Nica:
Polynomials over structured grids. 284-298 - Luka Milicevic:
Approximately symmetric forms far from being exactly symmetric. 299-315 - Asaf Ferber, Ashwin Sah, Mehtaab Sawhney, Yizhe Zhu:
Sparse recovery properties of discrete random matrices. 316-325 - Raphael Steiner:
Improved bound for improper colourings of graphs with no odd clique minor. 326-333 - Lucas Boczkowski, Igor Shinkar:
On mappings on the hypercube with small average stretch. 334-348 - Alex Cameron, Emily Heath:
New upper bounds for the Erdős-Gyárfás problem on generalized Ramsey numbers. 349-362
Volume 32, Number 3, May 2023
- Tom Hutchcroft, Alexander Kent, Petar Nizic-Nikolac:
The bunkbed conjecture holds in the p\uparrow 1 limit. 363-369 - James Foster, Karen Habermann:
Brownian bridge expansions for Lévy area approximations and particular values of the Riemann zeta function. 370-397 - Elvira Moreno, Mauricio Velasco:
On random walks and switched random walks on homogeneous spaces. 398-421 - Sahar Diskin, Michael Krivelevich:
Supercritical site percolation on the hypercube: small components are small. 422-427 - Bhaswar B. Bhattacharya, Anirban Chatterjee, Svante Janson:
Fluctuations of subgraph counts in graphon based random graphs. 428-464 - Eoin Long, Laurentiu Ploscaru:
A bipartite version of the Erdős-McKay conjecture. 465-477 - George Andriopoulos:
Convergence of blanket times for sequences of random walks on critical random graphs. 478-515 - David Conlon, Jacob Fox, Yuval Wigderson:
Off-diagonal book Ramsey numbers. 516-545
Volume 32, Number 4, July 2023
- Tao Jiang, Sean Longbrake, Jie Ma:
Bipartite-ness under smooth conditions. 546-558 - Richard Arratia, E. Rodney Canfield, Alfred W. Hales:
Random feedback shift registers and the limit distribution for largest cycle lengths. 559-593 - Nicolás Rivera, Thomas Sauerwald, John Sylvester:
Multiple random walks on graphs: mixing few to cover many. 594-637 - Maria Axenovich, Christian Winter:
Poset Ramsey numbers: large Boolean lattice versus a fixed poset. 638-653 - Andrew Newman:
Abelian groups from random hypergraphs. 654-664 - Jie Han, Ping Hu, Guanghui Wang, Donglei Yang:
Clique-factors in graphs with sublinear ?-independence number. 665-681 - Jesse Campion Loth, Bojan Mohar:
Expected number of faces in a random embedding of any graph is at most linear. 682-690 - Zoltán Füredi, András Gyárfás, Zoltán Király:
Problems and results on 1-cross-intersecting set pair systems. 691-702
Volume 32, Number 5, September 2023
- Ander Lamaison:
Ramsey upper density of infinite graphs. 703-723 - Lior Gishboliner, Benny Sudakov:
Maximal chordal subgraphs. 724-741 - Fabrizio Frati, Michael Hoffmann, Csaba D. Tóth:
Universal geometric graphs. 742-761 - Bjarne Schülke:
A pair degree condition for Hamiltonian cycles in 3-uniform hypergraphs. 762-781 - Anurag Bishnoi, Simona Boyadzhiyska, Shagnik Das, Tamás Mészáros:
Subspace coverings with multiplicities. 782-795 - Nina Kamcev, Alp Müyesser:
Unavoidable patterns in locally balanced colourings. 796-808 - Sam Spiro:
A smoother notion of spread hypergraphs. 809-818 - Dingding Dong, Nitya Mani, Yufei Zhao:
On the number of error correcting codes. 819-832 - Alberto Espuny Díaz, Yury Person:
Spanning -cycles in random graphs. 833-850
Volume 32, Number 6, November 2023
- Ádám Timár:
Unimodular random one-ended planar graphs are sofic. 851-858 - Simon Briend, Francisco Calvillo, Gábor Lugosi:
Archaeology of random recursive dags and Cooper-Frieze random networks. 859-873 - David Conlon, Rajko Nenadov, Milos Trujic:
On the size-Ramsey number of grids. 874-880 - Simón Piga, Marcelo Tadeu de Sá Oliveira Sales, Bjarne Schülke:
The codegree Turán density of tight cycles minus one edge. 881-884 - Joel Larsson Danielsson, Klas Markström:
Polarised random -SAT. 885-899 - Cong Luo, Jie Ma, Tianchi Yang:
On the maximum number of edges in -critical graphs. 900-911 - Agelos Georgakopoulos, Christoforos Panagiotis:
On the exponential growth rates of lattice animals and interfaces. 912-955 - Ke Wang, Philip Matchett Wood:
Limiting empirical spectral distribution for the non-backtracking matrix of an Erdős-Rényi random graph. 956-973
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 2024-09-21 23:42 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:
