Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorics, Probability & Computing, Volume 29
Volume 29, Number 1, January 2020
- Meysam Alishahi, Hossein Hajiabolhassan
:
On the Chromatic Number of Matching Kneser Graphs. 1-21 - Omer Angel, Asaf Ferber, Benny Sudakov, Vincent Tassion:
Long Monotone Trails in Random Edge-Labellings of Random Graphs. 22-30 - Simeon Ball, Bence Csajbók:
On sets of points with few odd secants. 31-43 - Patrick Bennett, Andrzej Dudek, Bernard Lidický, Oleg Pikhurko:
Minimizing the number of 5-cycles in graphs with given edge-density. 44-67 - Lorenzo Federico, Remco van der Hofstad, Frank Den Hollander, Tim Hulshof:
Expansion of Percolation Critical Points for Hamming Graphs. 68-100 - Jacob Fox, Ray Li:
On Ramsey numbers of hedgehogs. 101-112 - Rajko Nenadov, Nemanja Skoric:
On Komlós' tiling theorem in random graphs. 113-127 - Bo Ning, Xing Peng:
Extensions of the Erdős-Gallai theorem and Luo's theorem. 128-136 - Ross G. Pinsky:
The Infinite limit of random permutations avoiding patterns of length three. 137-152 - Shachar Sapir, Asaf Shapira:
The Induced Removal Lemma in Sparse Graphs. 153-162
Volume 29, Number 2, March 2020
- Noga Alon, Dan Hefetz, Michael Krivelevich, Mykhaylo Tyomkyn:
Edge-statistics on large graphs. 163-189 - Omer Angel, Abbas Mehrabian, Yuval Peres:
The string of diamonds is nearly tight for rumour spreading. 190-199 - Yuval Filmus:
FKN theorem for the multislice, with applications. 200-212 - Annika Heckel:
Sharp concentration of the equitable chromatic number of dense random graphs. 213-233 - Peter Keevash, Liana Yepremyan:
On the number of symbols that forces a transversal. 234-240 - Mickaël Maazoun:
On the Brownian separable permuton. 241-266 - Hoi H. Nguyen, Elliot Paquette:
Surjectivity of near-square random matrices. 267-292 - Benedikt Stufler:
Unlabelled Gibbs partitions. 293-309 - Joshua Zahl:
Counting higher order tangencies for plane curves. 310-317
Volume 29, Number 3, May 2020
- Matija Bucic, Sven Heberle, Shoham Letzter, Benny Sudakov:
Monochromatic trees in random tournaments. 318-345 - Amin Coja-Oghlan, Tobias Kapetanopoulos, Noëla Müller:
The replica symmetric phase of random constraint satisfaction problems. 346-422 - Beka Ergemlidze, Ervin Györi, Abhishek Methuku, Nika Salia, Casey Tompkins, Oscar Zamora:
Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2. 423-435 - Dániel Grósz, Abhishek Methuku, Casey Tompkins:
On subgraphs of C2k-free graphs and a problem of Kühn and Osthus. 436-454 - James B. Martin, Roman Stasinski:
Minimax functions on Galton-Watson trees. 455-484
Volume 29, Number 4, July 2020
- Amir Yehudayoff:
Pointer chasing via triangular discrimination. 485-494 - Boris Bukh, Michael Tait:
Turán numbers of theta graphs. 495-507 - Michael C. H. Choi, Pierre Patie:
Analysis of non-reversible Markov chains via similarity orbits. 508-536 - Dennis Clemens, Anita Liebenau, Damian Reding:
On minimal Ramsey graphs and Ramsey equivalence in multiple colours. 537-554 - Charilaos Efthymiou:
Deterministic counting of graph colourings using sequences of subgraphs. 555-586 - Agelos Georgakopoulos, John Haslegrave:
Percolation on an infinitely generated group. 587-615 - Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni:
Estimating parameters associated with monotone properties. 616-632 - Jason Long:
A note on the Brown-Erdős-Sós conjecture in groups. 633-640
Volume 29, Number 5, September 2020
- Heiner Oberkampf, Mathias Schacht:
On the structure of Dense graphs with bounded clique number. 641-649 - Orit E. Raz:
A note on distinct distances. 650-663 - Michael Haythorpe, Alex Newcombe:
Constructing families of cospectral regular graphs. 664-671 - Sam Greenberg, Dana Randall, Amanda Pascoe Streib:
Sampling biased monotonic surfaces using exponential metrics. 672-697 - Tao Jiang, Liana Yepremyan:
Supersaturation of even linear cycles in linear hypergraphs. 698-721 - Emma Yu Jin, Benedikt Stufler:
Graph limits of random unlabelled k-trees. 722-746 - Dániel Korándi, István Tomon:
Improved Ramsey-type results for comparability graphs. 747-756 - Patrick Bennett, Andrzej Dudek, Shira Zerbib:
Large triangle packings and Tuza's conjecture in sparse random graphs. 757-779 - Alessandra Graf, Penny Haxell:
Finding independent transversals efficiently. 780-806
Volume 29, Number 6, November 2020
- Gabriel Conant:
On finite sets of small tripling or small alternation in arbitrary groups. 807-829 - Shagnik Das, Andrew Treglown:
Ramsey properties of randomly perturbed graphs: cliques and cycles. 830-867 - Stefan Ehard, Stefan Glock, Felix Joos:
Pseudorandom hypergraph matchings. 868-885 - Anita Liebenau, Yanitsa Pehova:
An approximate version of Jackson's conjecture. 886-899 - Richard Montgomery:
Hamiltonicity in random directed graphs is born resilient. 900-942 - Frank Mousset, Rajko Nenadov, Wojciech Samotij:
Towards the Kohayakawa-Kreuter conjecture on asymmetric Ramsey properties. 943-955 - Asaf Ferber, Asaf Shapira:
A quantitative Lovász criterion for Property B. 956-960
a service of 
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-07-29 21:19 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:
