default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorics, Probability & Computing, Volume 30
Volume 30, Number 1, January 2021
- Ryan Alweiss, Chady Ben Hamida, Xiaoyu He
, Alexander Moreira:
On the subgraph query problem. 1-16 - Padraig Condon, Alberto Espuny Díaz, António Girão, Daniela Kühn, Deryk Osthus:
Dirac's theorem for random regular graphs. 17-36 - Rami Daknama, Konstantinos Panagiotou, Simon Reisser:
Robustness of randomized rumour spreading. 37-78 - Laura Eslava:
A non-increasing tree growth process for recursive trees and applications. 79-104 - James Allen Fill:
Breaking bivariate records. 105-123 - Heng Guo, Mark Jerrum:
Approximately counting bases of bicircular matroids. 124-135 - Richard Lang, Allan Lo:
Monochromatic cycle partitions in random graphs. 136-152 - Mykhaylo Tyomkyn:
Many disjoint triangles in co-triangle-free graphs. 153-162
Volume 30, Number 2, March 2021
- Asaf Ferber, Kyle Luh, Gweneth McKinley:
Resilience of the rank of random matrices. 163-174 - A. Nicholas Day, Victor Falgas-Ravry:
Maker-Breaker percolation games I: crossing grids. 200-227 - Deepak Bal, Ross Berkowitz, Pat Devlin, Mathias Schacht:
Hamiltonian Berge cycles in random hypergraphs. 228-238 - Deepak Bal, Ross Berkowitz, Pat Devlin, Mathias Schacht:
Finding tight Hamilton cycles in random hypergraphs faster. 239-257 - Huiqiu Lin, Bo Ning, Baoyindureng Wu:
Eigenvalues and triangles in graphs. 258-270 - Adam Blumenthal, Bernard Lidický, Yanitsa Pehova, Florian Pfender, Oleg Pikhurko, Jan Volec:
Sharp bounds for decomposing graphs into edges and triangles. 271-287 - Jie Han, Allan Lo, Nicolás Sanhueza-Matamala:
Covering and tiling hypergraphs with tight cycles. 288-329
Volume 30, Number 3, May 2021
- Marthe Bonamy, Nicolas Bousquet, Guillem Perarnau:
Frozen (Δ + 1)-colourings of bounded degree graphs. 330-343 - Ararat Harutyunyan, Paul Horn, Jacques Verstraëte:
Independent dominating sets in graphs of girth five. 344-359 - Noga Alon, Raimundo Briceño, Nishant Chandgotia, Alexander Magazinov, Yinon Spinka:
Mixing properties of colourings of the ℤd lattice. 360-373 - Joel Larsson:
The minimum perfect matching in pseudo-dimension 0 < q < 1. 374-397 - Cole Franks:
A simplified disproof of Beck's three permutations conjecture and an application to root-mean-squared discrepancy. 398-411 - Elad Aigner-Horev, Gil Levy:
Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs. 412-443 - József Balogh, Béla Csaba, András Pluhár, Andrew Treglown:
A discrepancy version of the Hajnal-Szemerédi theorem. 444-459 - Catherine S. Greenhill, Mikhail Isaev, Brendan D. McKay:
Subgraph counts for dense random graphs with specified degrees. 460-497
Volume 30, Number 4, July 2021
- János Pach, Gábor Tardos, Géza Tóth:
Disjointness graphs of segments in the space. 498-512 - Tom Johnston, Alex D. Scott:
Lipschitz bijections between boolean functions. 513-525 - Vytautas Gruslys, Shoham Letzter:
Cycle partitions of regular graphs. 526-549 - Per Kristian Lehre, Carsten Witt:
Tail bounds on hitting times of randomized search heuristics using variable drift analysis. 550-569 - Jie Han, Yoshiharu Kohayakawa, Yury Person:
Near-perfect clique-factors in sparse pseudorandom graphs. 570-590 - W. T. Gowers, Barnabás Janzer:
Generalizations of the Ruzsa-Szemerédi and rainbow Turán problems for cliques. 591-608 - József Balogh, Felix Christian Clemen, Mikhail Lavrov, Bernard Lidický, Florian Pfender:
Making Kr+1-free graphs r-partite. 609-618 - Joshua Erde, Mihyun Kang, Michael Krivelevich:
Large complete minors in random subgraphs. 619-630 - Stefan Glock, Stephen Gould, Felix Joos, Daniela Kühn, Deryk Osthus:
Counting Hamilton cycles in Dirac hypergraphs. 631-653
Volume 30, Number 5, September 2021
- G. R. Omidi:
A proof of a conjecture of Gyárfás, Lehel, Sárközy and Schelp on Berge-cycles. 654-669 - Dennis Clemens, Meysam Miralaei, Damian Reding, Mathias Schacht, Anusch Taraz:
On the size-Ramsey number of grid graphs. 670-685 - W. T. Gowers, Jason Long:
The length of an s-increasing sequence of r-tuples. 686-721 - Hiêp Hàn, Troy Retter, Vojtech Rödl, Mathias Schacht:
Ramsey-type numbers involving graphs and hypergraphs with large girth. 722-740 - Guido Besomi, Matías Pavez-Signé, Maya Stein:
On the Erdős-Sós conjecture for trees with bounded degree. 741-761 - Pu Gao, Reshma Ramadurai, Ian M. Wanless, Nick Wormald:
Full rainbow matchings in graphs and hypergraphs. 762-780 - Hong Liu, Péter Pál Pach, Richárd Palincza:
The number of maximum primitive sets of integers. 781-795 - Ashwin Sah, Mehtaab Sawhney, Jonathan Tidor, Yufei Zhao:
A counterexample to the Bollobás-Riordan conjectures on sparse graph limits. 796-799 - Hüseyin Acan, Charles F. Burnette, Sean Eberhard, Eric Schmutz, James Thomas:
Permutations with equal orders. 800-810
Volume 30, Number 6, November 2021
- Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Philipp Loick:
Optimal group testing. 811-848 - Svante Janson:
Tree limits and limits of random trees. 849-893 - Nemanja Draganic, François Dross, Jacob Fox, António Girão, Frédéric Havet, Dániel Korándi, William Lochet, David Munhá Correia, Alex D. Scott, Benny Sudakov:
Powers of paths in tournaments. 894-898 - Sean Eberhard, Jeff Kahn, Bhargav Narayanan, Sophie Spirkl:
On symmetric intersecting families of vectors. 899-904 - Martin E. Dyer, Marc Heinrich, Mark Jerrum, Haiko Müller:
Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs. 905-921 - Ben Green, Aled Walker:
Extremal problems for GCDs. 922-929 - Bodan Arsovski:
Additive bases via Fourier analysis. 930-941 - Matija Bucic, Nemanja Draganic, Benny Sudakov:
Universal and unavoidable graphs. 942-955 - Leonid Gurvits, Jonathan Leake:
Counting matchings via capacity-preserving operators. 956-981 - István Tomon, Dmitriy Zakharov:
Turán-type results for intersection graphs of boxes. 982-987
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-11-09 22:57 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:
