default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorics, Probability & Computing, Volume 28
Volume 28, Number 1, January 2019
- Antonio Blanca, Yuxuan Chen, David J. Galvin, Dana Randall, Prasad Tetali:
Phase Coexistence for the Hard-Core Model on ℤ2. 1-22 - Christina Goldschmidt
, Michal Przykucki:
Parking on a Random Tree. 23-45 - Renan Gross, Uri Grupel:
Indistinguishable Sceneries on the Boolean Hypercube. 46-60 - Arran Hamm, Jeff Kahn:
On Erdős-Ko-Rado for Random Hypergraphs II. 61-80 - Svante Janson:
Random Recursive Trees and Preferential Attachment Trees are Random Split Trees. 81-99 - Jiange Li, Mokshay Madiman:
A Combinatorial Approach to Small Ball Inequalities for Sums and Differences. 100-129 - Felicia Raßmann:
On the Number of Solutions in Random Graph k-Colouring. 130-158
Volume 28, Number 2, March 2019
- József Balogh, Andrew Treglown, Zsolt Adam Wagner:
Tilings in Randomly Perturbed Dense Graphs. 159-176 - Nicolas Bousquet, Louis Esperet, Ararat Harutyunyan, Rémi de Joannis de Verclos:
Exact Distance Colouring in Trees. 177-186 - Stephen Desalvo, Igor Pak:
Limit Shapes via Bijections. 187-240 - Beka Ergemlidze, Ervin Györi, Abhishek Methuku:
Turán Number of an Induced Complete Bipartite Graph Plus an Odd Cycle. 241-252 - Olav Geil, Umberto Martínez-Peñas:
Bounding the Number of Common Zeros of Multivariate Polynomials and Their Consecutive Derivatives. 253-279 - Andrey Kupavskii, Nabil H. Mustafa, Konrad J. Swanepoel:
Bounding the Size of an Almost-Equidistant Set in Euclidean Space. 280-286 - Anders Martinsson:
A Linear Threshold for Uniqueness of Solutions to Random Jigsaw Puzzles. 287-302 - Dhruv Mubayi, Caroline Terry:
An Extremal Graph Problem with a Transcendental Solution. 303-324
Volume 28, Number 3, May 2019
- Erik Bates, Lisa Sauermann:
An Upper Bound on the Size of Avoidance Couplings. 325-334 - Xing Shi Cai, Cecilia Holmgren, Svante Janson, Tony Johansson, Fiona Skerman:
Inversions in Split Trees and Conditional Galton-Watson Trees. 335-364 - Sarah Cannon, David A. Levin, Alexandre Stauffer:
Polynomial Mixing of the Edge-Flip Markov Chain for Unbiased Dyadic Tilings. 365-387 - Alexander E. Holroyd, Lionel Levine, Peter Winkler:
Abelian Logic Gates. 388-422 - Dong Yeap Kang:
Sparse Highly Connected Spanning Subgraphs in Dense Directed Graphs. 423-464 - Daniel Král', Bernard Lidický, Taísa L. Martins, Yanitsa Pehova:
Decomposing Graphs into Edges and Triangles. 465-472 - Nabil H. Mustafa, Saurabh Ray:
On a Problem of Danzer. 473-482
Volume 28, Number 4, July 2019
- Hsien-Kuei Hwang, Ralph Neininger, Marek Zaionc:
Preface. 483-484
- Martin Aumüller, Martin Dietzfelbinger, Clemens Heuberger, Daniel Krenn, Helmut Prodinger:
Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths. 485-518 - G. Collet, Michael Drmota, Lukas Daniel Klausner:
Limit laws of planar maps with prescribed vertex degrees. 519-541 - Michael Drmota, Abram Magner, Wojciech Szpankowski:
Asymmetric Rényi Problem. 542-573 - Markus Kuba, Alois Panholzer:
Combinatorial Analysis of Growth Models for Series-Parallel Networks. 574-599 - Patricio V. Poblete, Alfredo Viola:
Analysis of Robin Hood and Other Hashing Algorithms Under the Random Probing Model, With and Without Deletions. 600-617 - Dimbinaina Ralaivaosaona, Stephan G. Wagner:
A central limit theorem for additive functionals of increasing trees. 618-637 - Vonjy Rasendrahasina, Andry Rasoanaivo, Vlady Ravelomanana:
Expected Maximum Block Size in Critical Random Graphs. 638-655
Volume 28, Number 5, September 2019
- Gopal Goel, Andrew Ahn:
Discrete derivative asymptotics of the β-Hermite eigenvalues. 657-674 - Lina Jansson Andrén, Carl Johan Casselgren, Klas Markström:
Restricted completion of sparse partial Latin squares. 675-695 - Alexander I. Barvinok, Guus Regts:
Weighted counting of solutions to sparse systems of equations. 696-719 - Louis Esperet, Ross J. Kang, Stéphan Thomassé:
Separation Choosability and Dense Bipartite Induced Subgraphs. 720-732 - Peter Frankl:
A near-exponential improvement of a bound of Erdős and Lovász on maximal intersecting families. 733-739 - Dong Yeap Kang, Sang-il Oum:
Improper colouring of graphs with no odd clique minor. 740-754 - Shinya Fujita, Ruonan Li, Guanghui Wang:
Decomposing edge-coloured graphs under colour degree constraints. 755-767 - Allan Lo, Nicolás Sanhueza-Matamala:
An asymptotic bound for the strong chromatic number. 768-776 - Jacob Fox, László Miklós Lovász, Yufei Zhao:
A fast new algorithm for weak graph regularity. 777-790 - Kevin Hendrey, David R. Wood:
Defective and clustered choosability of sparse graphs. 791-810
Volume 28, Number 6, November 2019
- François Bienvenu:
Positive association of the oriented percolation cluster in randomly oriented graphs. 811-815 - Patrick Bennett, Tom Bohman:
A natural barrier in random greedy hypergraph matching. 816-825 - David Ellis, Noam Lifshitz:
On the union of intersecting families. 826-839 - Wei Gao, Jie Han, Yi Zhao:
Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles. 840-870 - Ramin Javadi, Farideh Khoeini, G. R. Omidi, Alexey Pokrovskiy:
On the Size-Ramsey Number of Cycles. 871-880 - Arran Hamm, Jeff Kahn:
On Erdős-Ko-Rado for random hypergraphs I. 881-916
- Svante Linusson:
Erratum to 'On Percolation and the Bunkbed Conjecture'. 917-918
- Katalin Marton:
Logarithmic Sobolev inequalities in discrete product spaces. 919-935 - Andrew J. Uzzell:
An Improved Upper Bound for Bootstrap Percolation in All Dimensions. 936-960
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-12-09 00:13 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:
