default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorics, Probability & Computing, Volume 27
Volume 27, Number 1, January 2018
- Ágnes Backhausz, Balázs Gerencsér, Viktor Harangi, Máté Vizer:
Correlation Bounds for Distant Parts of Factor of IID Processes. 1-20 - Henning Bruhn, Felix Joos:
A Stronger Bound for the Strong Chromatic Index. 21-43 - Genghua Fan, Jianfeng Hou, Xingxing Yu:
Bisections of Graphs Without Short Cycles. 44-59 - Peter Frankl, Andrey Kupavskii:
Counting Intersecting and Pairs of Cross-Intersecting Families. 60-68 - Nathan Linial, Michael Simkin
:
Monotone Subsequences in High-Dimensional Permutations. 69-83 - Aaron M. Montgomery:
Asymptotic Enumeration of Difference Matrices over Cyclic Groups. 84-109 - Bhargav P. Narayanan, István Tomon:
Induced Subgraphs With Many Distinct Degrees. 110-123 - van Vu:
A Simple SVD Algorithm for Finding Hidden Partitions. 124-140
Volume 27, Number 2, March 2018
- Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa, Barnaby Roberts:
Triangle-Free Subgraphs of Random Graphs. 141-161 - Van Hao Can:
Super-Exponential Extinction Time of the Contact Process on Random Geometric Graphs. 162-185 - Péter L. Erdös, István Miklós, Zoltán Toroczkai:
New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling. 186-207 - Ohad N. Feldheim, Yinon Spinka:
The Growth Constant of Odd Cutsets in High Dimensions. 208-227 - Alan M. Frieze, Tony Johansson:
On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph. 228-244 - Andrey Kupavskii, Dmitry A. Shabanov:
Colourings of Uniform Hypergraphs with Large Girth and Applications. 245-273 - Po-Shen Loh, Michael Tait, Craig Timmons, Rodrigo M. Zhou:
Induced Turán Numbers. 274-288
Volume 27, Number 3, May 2018
- Igor Balla, Alexey Pokrovskiy, Benny Sudakov:
Ramsey Goodness of Bounded Degree Trees. 289-309 - Anurag Bishnoi, Pete L. Clark, Aditya Potukuchi, John R. Schmitt:
On Zeros of a Polynomial in a Finite Grid. 310-333 - Raphaël Bouyrie:
On Quantitative Noise Stability and Influences for Discrete and Continuous Models. 334-357 - Clayton Collier-Cartaino, Nathan Graber, Tao Jiang:
Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers. 358-386 - Hal A. Kierstead, Alexandr V. Kostochka, Andrew McConvey:
A Sharp Dirac-Erdős Type Bound for Large Graphs. 387-397 - Seongmin Ok, Thomas J. Perrett:
Density of Real Zeros of the Tutte Polynomial. 398-410 - Shravas Rao, Igor Shinkar:
On Lipschitz Bijections Between Boolean Functions. 411-426 - Pablo Soberón:
Robust Tverberg and Colourful Carathéodory Results via Random Choice. 427-440
Volume 27, Number 4, July 2018
- Paul Balister, Béla Bollobás, Imre Leader, Robert Morris:
Introduction. 441
- Noga Alon:
Uniformly Discrete Forests with Poor Visibility. 442-448 - József Balogh, Andrew McDowell, Theodore Molla, Richard Mycroft:
Triangle-Tilings in Graphs Without Large Independent Sets. 449-474 - Joseph Briggs, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh:
Packing Hamilton Cycles Online. 475-495 - Amin Coja-Oghlan, Nick Wormald:
The Number of Satisfying Assignments of Random Regular k-SAT Formulas. 496-530 - Dwight Duffus, Bill Kay, Vojtech Rödl:
The Minimum Number of Edges in Uniform Hypergraphs with Property O. 531-538 - Jacob Fox, Fan Wei:
Fast Property Testing and Metrics for Permutations. 539-579 - Vytautas Gruslys, Shoham Letzter:
Minimizing the Number of Triangular Edges. 580-622 - Nina Kamcev, Tomasz Luczak, Benny Sudakov:
Anagram-Free Colourings of Graphs. 623-642 - Johannes Lengler, Angelika Steger:
Drift Analysis and Evolutionary Algorithms Revisited. 643-666 - Bhargav Narayanan:
Connections in Randomly Oriented Graphs. 667-671 - Dudley Stark, Nick Wormald:
The Probability of Non-Existence of a Subgraph in a Moderately Sparse Random Graph. 672-715
Volume 27, Number 5, September 2018
- Ferenc Bencs:
Christoffel-Darboux Type Identities for the Independence Polynomial. 716-724 - Wouter Cames van Batenburg, Ross J. Kang:
Packing Graphs of Bounded Codegree. 725-740 - Oliver Cooley, Mihyun Kang, Yury Person:
Largest Components in Random Hypergraphs. 741-762 - Agelos Georgakopoulos, Stephan Wagner:
Subcritical Graph Classes Containing All Planar Graphs. 763-773 - Penny Haxell, Lothar Narins:
A Stability Theorem for Matchings in Tripartite 3-Graphs. 774-793 - Ross J. Kang, François Pirot:
Distance Colouring Without One Cycle Length. 794-807 - Leonid A. Levin, Ramarathnam Venkatesan:
An Average Case NP-complete Graph Colouring Problem. 808-828 - Shiping Liu, Norbert Peyerimhoff:
Eigenvalue Ratios of Non-Negatively Curved Graphs. 829-850
- Jacob Fox, László Miklós Lovász, Yufei Zhao:
Erratum: On Regularity Lemmas and their Algorithmic Applications. 851-852
Volume 27, Number 6, November 2018
- Gerandy Brito, Christopher Fowler, Matthew Junge, Avi Levy:
Ewens Sampling and Invariable Generation. 853-891 - Alex Cameron, Emily Heath:
A (5, 5)-Colouring of Kn with Few Colours. 892-912 - Andrew J. Goodall, Thomas Krajewski, Guus Regts, Lluís Vena:
A Tutte Polynomial for Maps. 913-945 - Laurent Ménard:
Volumes in the Uniform Infinite Planar Triangulation: From Skeletons to Generating Functions. 946-973 - Dhruv Mubayi, Lujia Wang:
Multicolour Sunflowers. 974-987 - Thomas J. Perrett, Carsten Thomassen:
Density of Chromatic Roots in Minor-Closed Graph Families. 988-998
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-04 01:28 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:
