default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorics, Probability & Computing, Volume 20, 2011
Volume 20, Number 1, January 2011
- Sven Erick Alm, Svante Linusson:
A Counter-Intuitive Correlation in a Random Tournament. 1-9 - Hoda Bidkhori, Shaunak Kishore:
A Bijective Proof of a Theorem of Knuth. 11-25 - David J. Galvin:
A Threshold Phenomenon for Random Independent Sets in the Discrete Hypercube. 27-51 - András Gyárfás, Gábor N. Sárközy:
The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle. 53-71 - Torsten Inkmann, Robin Thomas:
Minor-Minimal Planar Graphs of Even Branch-Width. 73-82 - Nathan Keller:
On the Influences of Variables on Boolean Functions in Product Spaces. 83-102 - Svante Linusson:
On Percolation and the Bunkbed Conjecture. 103-117 - Micha Sharir:
An Improved Bound for k-Sets in Four Dimensions. 119-129 - Tatyana S. Turova
:
The Largest Component in Subcritical Inhomogeneous Random Graphs. 131-154 - Guy Wolfovitz:
Sub-Gaussian Tails for the Number of Triangles in G( n, p). 155-160
Volume 20, Number 2, March 2011
- Rahil Baber, John M. Talbot:
Hypergraphs Do Jump. 161-171 - Sonny Ben-Shimon, Michael Krivelevich, Benny Sudakov:
Local Resilience and Hamiltonicity Maker-Breaker Games in Random Regular Graphs. 173-211 - Persi Diaconis, Laurent Miclo:
On Barycentric Subdivision. 213-237 - Stefanie Gerke, Angelika Steger, Nicholas C. Wormald:
Pegging Graphs Yields a Small Diameter. 239-248 - Yahya Ould Hamidoune, Juanjo Rué:
A Lower Bound for the Size of a Minkowski Sum of Dilates. 249-256 - Jeff Kahn, Michael E. Saks, Clifford D. Smyth:
The Dual BKR Inequality and Rudich's Conjecture. 257-266 - Vyacheslav Krushkal:
Graphs, Links, and Duality on Surfaces. 267-287 - Eric Schmutz:
Period Lengths for Iterated Functions. 289-298 - Yusuke Watanabe, Kenji Fukumizu:
New Graph Polynomials from the Bethe Approximation of the Ising Partition Function. 299-320
Volume 20, Number 3, May 2011
- Noga Alon, Pawel Pralat:
Modular Orientations of Random and Quasi-Random Regular Graphs. 321-329 - Martin T. Barlow, Jian Ding, Asaf Nachmias, Yuval Peres:
The Evolution of the Cover Time. 331-345 - Joshua Brown Kramer, Jonathan Cutler, A. J. Radcliffe:
Negative Dependence and Srinivasan's Sampling Process. 347-361 - David Ellis:
Almost Isoperimetric Subsets of the Discrete Cube. 363-380 - Nikolaos Fountoulakis, Konstantinos Panagiotou:
3-Connected Cores In Random Planar Graphs. 381-412 - Brendan D. McKay:
Subgraphs of Dense Random Graphs with Specified Degrees. 413-433 - Leandro P. R. Pimentel:
Asymptotics for First-Passage Times on Delaunay Triangulations. 435-453 - Alexander Scott:
Szemerédi's Regularity Lemma for Matrices and Sparse Graphs. 455-466 - Johan Wästlund:
The Blind Passenger and the Assignment Problem. 467-480
Volume 20, Number 4, July 2011
- Noga Alon, Chen Avin, Michal Koucký, Gady Kozma, Zvi Lotker, Mark R. Tuttle:
Many Random Walks Are Faster Than One. 481-502 - Roel Apfelbaum, Micha Sharir:
Non-Degenerate Spheres in Three Dimensions. 503-512 - Thomas Böhme, Alexandr V. Kostochka, Andrew Thomason:
Minors in Graphs with High Chromatic Number. 513-518 - Sebastian M. Cioaba, André Kündgen, Craig Timmons, Vladislav V. Vysotsky:
Covering Complete r-Graphs with Spanning Complete r-Partite r-Graphs. 519-527 - Michael Drmota, Omer Giménez, Marc Noy:
The Maximum Degree of Series-Parallel Graphs. 529-570 - György Elekes, Micha Sharir:
Incidences in Three Dimensions and Distinct Distances in the Plane. 571-608 - Andrew J. Goodall, Anna de Mier, Steven D. Noble, Marc Noy:
The Tutte Polynomial Characterizes Simple Outerplanar Graphs. 609-616 - Abbas Mehrabian:
Lower Bounds for the Cop Number when the Robber is Fast. 617-621 - Piotr Micek, Bartosz Walczak:
A Graph-Grabbing Game. 623-629 - Baogang Xu, Xingxing Yu:
Better Bounds for k-Partitions of Graphs. 631-640
Volume 20, Number 5, September 2011
- Alain Plagne:
Yahya Ould Hamidoune the Mauritanian mathematician 1948 - 11 March 2011. 641-645 - Bruno Salvy, Bob Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée:
Philippe Flajolet 1 December 1948 - 22 March 2011. 647-649
- Josh Abramson, Jim Pitman:
Concave Majorants of Random Walks and Related Poisson Processes. 651-682 - Shankar Bhamidi, Remco van der Hofstad, Gerard Hooghiemstra:
First Passage Percolation on the Erdős-Rényi Random Graph. 683-707 - Rodrigo Bissacot, Roberto Fernández, Aldo Procacci, Benedetto Scoppola:
An Improvement of the Lovász Local Lemma via Cluster Expansion. 709-719 - Tom Bohman, Alan M. Frieze:
Karp-Sipser on Random Graphs with a Fixed Degree Sequence. 721-741 - Béla Bollobás, Imre Leader, Claudia Malvenuto:
Daisies and Other Turán Problems. 743-747 - Peter Frankl, Norihide Tokushige:
On r-Cross Intersecting Families of Sets. 749-752 - Jason E. Fulman, Larry Goldstein:
Zero Biasing and Jack Measures. 753-762 - Valentas Kurauskas, Colin McDiarmid:
Random Graphs with Few Disjoint Cycles. 763-775 - Hoi H. Nguyen:
On the Distribution of Three-Term Arithmetic Progressions in Sparse Subsets of Fpn. 777-791 - Tomasz Schoen, Ilya D. Shkredov:
On Sumsets of Convex Sets. 793-798
Volume 20, Number 6, November 2011
- Alessandro Arlotto, J. Michael Steele:
Optimal Sequential Selection of a Unimodal Subsequence of a Random Sequence. 799-814 - Alexander I. Barvinok, Alex Samorodnitsky:
Computing the Partition Function for Perfect Matchings in a Hypergraph. 815-835 - Neal Bushaw, Nathan Kettle:
Turán Numbers of Multiple Paths and Equibipartite Forests. 837-853 - Yahya Ould Hamidoune:
Counting Certain Pairings in Arbitrary Groups. 855-865 - Alain Plagne:
Sums of Dilates in Groups of Prime Order. 867-873 - Markus Kuba, Alois Panholzer:
Analysis of Statistics for Generalized Stirling Permutations. 875-910 - Cristopher Moore, Alexander Russell:
A Graph Integral Formulation of the Circuit Partition Polynomial. 911-920 - Giorgis Petridis:
Plünnecke's Inequality. 921-938 - Michael E. Picollelli:
The Final Size of the C4-Free Process. 939-955
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-02-24 21:20 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:
