Combinatorics, Probability & Computing, Volume 17, 2008
Volume 17, Number 1, January 2008
Alexander I. Barvinok: Enumerating Contingency Tables via Random Permanents. 1-19- Frédéric Chyzak, Michael Drmota, Thomas Klausner, Gerard Kok: The Distribution of Patterns in Random Trees. 21-59
- Yahya Ould Hamidoune: On Iterated Image Size for Point-Symmetric Relations. 61-66
- Mihyun Kang, Taral Guldahl Seierstad: The Critical Phase for Random Graphs with a Given Degree Sequence. 67-86
- Roberto Oliveira: Balls-in-Bins Processes with Feedback and Brownian Motion. 87-110
- Oliver Riordan: The k-Core and Branching Processes. 111-136
- Vincent Vatter: Enumeration Schemes for Restricted Permutations. 137-159
Volume 17, Number 2, March 2008
- Nicolas Broutin, Luc Devroye: An Analysis of the Height of Tries with Random Weights on the Edges. 161-202
- Adrian Dumitrescu, Csaba D. Tóth: On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space. 203-224
- Roberto Fernández, Aldo Procacci: Regions Without Complex Zeros for Chromatic Polynomials on Graphs with Bounded Degree. 225-238
- Raymond Hemmecke, Jason Morton, Anne Shiu, Bernd Sturmfels, Oliver Wienand: Three Counter-Examples on Semi-Graphoids. 239-257
- Hal A. Kierstead, Alexandr V. Kostochka: A Short Proof of the Hajnal-Szemerédi Theorem on Equitable Colouring. 265-270
- Vadim V. Lozin: Boundary Classes of Planar Graphs. 287-295
- T. Sanders: A Note on Freiman's Theorem in Vector Spaces. 297-305
- R. O. Y. Wagner: Tail Estimates for Sums of Variables Sampled by a Random Walk. 307-316
- Hans-Otto Georgii: The Random-Cluster Model, by Geoffrey Grimmett, Springer, 2006. 317-318
Volume 17, Number 3, May 2008
- Noga Alon, Oded Schwartz, Asaf Shapira: An Elementary Construction of Constant-Degree Expanders. 319-327
- Jean Bertoin: Two-Parameter Poisson-Dirichlet Measures and Reversible Exchangeable Fragmentation-Coalescence Processes. 329-337
- Arturas Dubickas: An Approximation by Lacunary Sequence of Vectors. 339-345
- Shmuel Friedland, Leonid Gurvits: Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer-Dimer Entropy. 347-361
- W. T. Gowers: Quasirandom Groups. 363-387
Volume 17, Number 4, July 2008
- Peter Allen: Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles. 471-486
- Charlotte A. C. Brennan, Arnold Knopfmacher, Stephan G. Wagner: The Distribution of Ascents of Size d or More in Partitions of n. 495-509
- Clifford C. Cocks: Correlated Matroids. 511-518
- Gerard Hooghiemstra, Piet Van Mieghem: The Weight and Hopcount of the Shortest Path in the Complete Graph with Exponential Weights. 537-548
- Jerzy Jaworski, Dudley Stark: The Vertex Degree Distribution of Passive Random Intersection Graph Models. 549-558
- Nathan Linial, Jirí Matousek, Or Sheffet, Gábor Tardos: Graph Colouring with No Large Monochromatic Components. 577-589
- Alexander A. Razborov: On the Minimal Density of Triangles in Graphs. 603-618
Volume 17, Number 5, September 2008
- Boris Bukh: Sums of Dilates. 627-639
- Michael Fuchs: Subtree Sizes in Recursive Trees and Binary Search Trees: Berry-Esseen Bounds and Poisson Approximations. 661-680
- Ron Holzman, Vsevolod F. Lev, Rom Pinchasi: Projecting Difference Sets on the Positive Orthant. 681-688
- Luke Kelly, Daniela Kühn, Deryk Osthus: A Dirac-Type Result on Hamilton Cycles in Oriented Graphs. 689-709
- Russell Lyons, R. O. N. Peled, Oded Schramm: Growth of the Number of Spanning Trees of the Erdös-Rényi Giant Component. 711-726
Volume 17, Number 6, November 2008
- Yahya Ould Hamidoune: A Weighted Generalization of Gao's n + D - 1 Theorem. 793-798
- Svante Janson: Individual Displacements in Hashing with Coalesced Chains. 799-814
- Ken-ichi Kawarabayashi: A Weakening of the Odd Hadwiger's Conjecture. 815-821
- Thomas M. Lewis: The Hitting Time for the Height of a Random Recursive Tree. 831-835
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team