default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorics, Probability & Computing, Volume 31
Volume 31, Number 1, January 2022
- Persi Diaconis, Ronald L. Graham, Xiaoyu He
, Sam Spiro:
Card guessing with partial feedback. 1-20 - Asaf Ferber, Matthew Kwan, Lisa Sauermann:
Singularity of sparse random matrices: simple proofs. 21-28 - Catherine S. Greenhill, Mikhail Isaev, Gary Liang:
Spanning trees in random regular uniform hypergraphs. 29-53 - Sergey G. Bobkov, Arnaud Marsiglietti, James Melbourne:
Concentration functions and entropy bounds for discrete log-concave distributions. 54-72 - Agelos Georgakopoulos, John Haslegrave, Thomas Sauerwald, John Sylvester:
The power of two choices for random walks. 73-100 - Boris Bukh, Ting-Wei Chao, Ron Holzman:
On convex holes in d-dimensional point sets. 101-108 - József Balogh, Alexandr V. Kostochka, Mikhail Lavrov, Xujun Liu:
Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree. 109-122 - Vida Dujmovic, Louis Esperet, Pat Morin, Bartosz Walczak, David R. Wood:
Clustered 3-colouring graphs of bounded degree. 123-135 - Bojan Mohar, Hehui Wu:
Triangle-free subgraphs with large fractional chromatic number. 136-143 - Thibaut Lemoine:
Large N behaviour of the two-dimensional Yang-Mills partition function. 144-165 - Nardo Giménez, Guillermo Matera, Mariana Pérez, Melina Privitelli:
Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field. 166-183
Volume 31, Number 2, March 2022
- Endre Csóka, Lukasz Grabowski:
On directed analogues of expander and hyperfinite graph sequences. 184-197 - Tobias Johnson:
Continuous phase transitions on Galton-Watson trees. 198-228 - Gerandy Brito, Ioana Dumitriu, Kameron Decker Harris:
Spectral gap in random bipartite biregular graphs and applications. 229-267 - Jin-Yi Cai, Artem Govorov:
Perfect matchings, rank of connection tensors and graph homomorphisms. 268-303 - Martin Kurecka:
Lower bound on the size of a quasirandom forcing set of permutations. 304-319 - Hariharan Narayanan, Piyush Srivastava:
On the mixing time of coordinate Hit-and-Run. 320-332 - Tao Jiang, Jie Ma, Liana Yepremyan:
On Turán exponents of bipartite graphs. 333-344 - Ryan R. Martin, Alex W. N. Riasanovsky:
On the edit distance function of the random graph. 345-367
Volume 31, Number 3, May 2022
- Gabriel Berzunza Ojeda, Svante Janson:
The distance profile of rooted and unrooted simply generated trees. 368-410 - Matthew Coulson:
The critical window in random digraphs. 411-429 - Markus Heydenreich, Kilian Matzke:
Expansion for the critical point of site percolation: the first three terms. 430-454 - Asaf Ferber, Vishesh Jain, Yufei Zhao:
On the number of Hadamard matrices via anti-concentration. 455-477 - Andrea Freschi, Joseph Hyde, Andrew Treglown:
On deficiency problems for graphs. 478-488 - Maria Axenovich, António Girão, Richard Snyder, Lea Weber:
Strong complete minors in digraphs. 489-506 - Rémi Cocou Avohou, Joseph Ben Geloun, Mahouton Norbert Hounkonnou:
Extending the Tutte and Bollobás-Riordan polynomials to rank 3 weakly coloured stranded graphs. 507-549
Volume 31, Number 4, July 2022
- Alejandro H. Morales, Igor Pak, Martin Tassy:
Asymptotics for the number of standard tableaux of skew shape and for weighted lozenge tilings. 550-573 - Lowell Abrams, Joanna A. Ellis-Monaghan:
New dualities from old: generating geometric, Petrie, and Wilson dualities and trialities of ribbon graphs. 574-597 - Peter Allen, Julia Böttcher, Julia Ehrenmüller, Jakob Schnitzer, Anusch Taraz:
A spanning bandwidth theorem in random graphs. 598-628 - Markus Kuba, Alois Panholzer:
On bucket increasing trees, clustered increasing trees and increasing diamonds. 629-661 - Vishesh Jain, Ashwin Sah, Mehtaab Sawhney:
On the smallest singular value of symmetric random matrices. 662-683 - Vojtech Rödl, Marcelo Tadeu Sales:
A blurred view of Van der Waerden type theorems. 684-701 - Matthew Jenssen, Will Perkins, Aditya Potukuchi:
Independent sets of a given size and structure in the hypercube. 702-720 - Jacob Fox, Yufei Zhao:
Removal lemmas and approximate homomorphisms. 721-736
Volume 31, Number 5, September 2022
- Mikhail Isaev, Angus Southwell, Maksim Zhukovskii:
Distribution of tree parameters by martingale approach. 737-764 - Maciej Bendkowski, Olivier Bodini, Sergey Dovgal:
Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers. 765-811 - Tony Huynh, Gwenaël Joret, David R. Wood:
Subgraph densities in a surface. 812-839 - Umberto De Ambroggio, Matthew I. Roberts:
Unusually large components in near-critical Erdős-Rényi graphs via ballot theorems. 840-869 - Nemanja Draganic, Stefan Glock, Michael Krivelevich:
Short proofs for long induced paths. 870-878 - Ivailo Hartarsky, Laure Marêché:
Refined universality for critical KCM: lower bounds. 879-906 - Andrzej Grzesik, Joonkyung Lee, Bernard Lidický, Jan Volec:
On tripartite common graphs. 907-923
Volume 31, Number 6, November 2022
- Antonio Blanca, Alistair Sinclair, Xusheng Zhang:
The critical mean-field Chayes-Machta dynamics. 924-975 - Freddie Illingworth:
The chromatic profile of locally colourable graphs. 976-1009 - Noga Alon, Asaf Nachmias, Matan Shalev:
The diameter of the uniform spanning tree of dense graphs. 1010-1030 - Beka Ergemlidze, Theodore Molla:
Transversal Ck-factors in subgraphs of the balanced blow-up of Ck. 1031-1047 - Ronen Eldan, Dan Mikulincer, Hester Pieters:
Community detection and percolation of information in a geometric setting. 1048-1069 - Raphael Steiner:
Improved lower bound for the list chromatic number of graphs with no Kt minor. 1070-1075 - Xizhi Liu:
Hypergraphs without non-trivial intersecting subgraphs. 1076-1091 - Allan Lo, Andrew Treglown, Yi Zhao:
Complete subgraphs in a multipartite graph. 1092-1101
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-10-31 20:05 CET 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:
