Journal: Combinatorics, Probability & Computing

Volume 17, Issue 6

727 -- 740Jomy Alappattu, J. I. M. Pitman. Coloured Loop-Erased Random Walk on the Complete Graph
741 -- 747Javier Cilleruelo, Carlos Vinuesa. ::::B::::::2::[ ::::g::::] Sets and a Conjecture of Schinzel and Schmidt
749 -- 759Feng Ming Dong, Khee Meng Koh. Bounds For The Real Zeros of Chromatic Polynomials
761 -- 779Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum. Dobrushin Conditions and Systematic Scan
781 -- 791Ohad N. Feldheim, Michael Krivelevich. Winning Fast in Sparse Graph Construction Games
793 -- 798Yahya Ould Hamidoune. A Weighted Generalization of Gao s ::::n:::: + ::::D:::: - 1 Theorem
799 -- 814Svante Janson. Individual Displacements in Hashing with Coalesced Chains
815 -- 821Ken-ichi Kawarabayashi. A Weakening of the Odd Hadwiger s Conjecture
823 -- 830Alexandr V. Kostochka, Dhruv Mubayi. When is an Almost Monochromatic ::::K::::::4:: Guaranteed?
831 -- 835Thomas M. Lewis. The Hitting Time for the Height of a Random Recursive Tree
837 -- 845Elizabeth R. Moseman, Peter Winkler. On a Form of Coordinate Percolation

Volume 17, Issue 5

627 -- 639Boris Bukh. Sums of Dilates
641 -- 660Yannick Frein, Benjamin Lévêque, András Sebö. Generating All Sets With Bounded Unions
661 -- 680Michael Fuchs. Subtree Sizes in Recursive Trees and Binary Search Trees: Berry-Esseen Bounds and Poisson Approximations
681 -- 688Ron Holzman, Vsevolod F. Lev, Rom Pinchasi. Projecting Difference Sets on the Positive Orthant
689 -- 709Luke Kelly, Daniela Kühn, Deryk Osthus. A Dirac-Type Result on Hamilton Cycles in Oriented Graphs
711 -- 726Russell Lyons, R. O. N. Peled, Oded Schramm. Growth of the Number of Spanning Trees of the Erdös-Rényi Giant Component

Volume 17, Issue 4

471 -- 486Peter Allen. Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
487 -- 494Itai Benjamini, Noam Berger, Ariel Yadin. Long-Range Percolation Mixing Time
495 -- 509Charlotte A. C. Brennan, Arnold Knopfmacher, Stephan Wagner. The Distribution of Ascents of Size ::::d:::: or More in Partitions of ::::n::::
519 -- 536Roland Häggkvist, Anders Johansson. Orthogonal Latin Rectangles
537 -- 548Gerard Hooghiemstra, Piet Van Mieghem. The Weight and Hopcount of the Shortest Path in the Complete Graph with Exponential Weights
549 -- 558Jerzy Jaworski, Dudley Stark. The Vertex Degree Distribution of Passive Random Intersection Graph Models
559 -- 575J. Robert Johnson, John M. Talbot. ::::G::::-Intersection Theorems for Matchings and Other Graphs
577 -- 589Nathan Linial, Jirí Matousek, Or Sheffet, Gábor Tardos. Graph Colouring with No Large Monochromatic Components
591 -- 601Colin McDiarmid, Bruce A. Reed. On the Maximum Degree of a Random Planar Graph
603 -- 618Alexander A. Razborov. On the Minimal Density of Triangles in Graphs
619 -- 625József Solymosi, Csaba D. Tóth. On a Question of Bourgain about Geometric Incidences

Volume 17, Issue 3

319 -- 327Noga Alon, Oded Schwartz, Asaf Shapira. An Elementary Construction of Constant-Degree Expanders
329 -- 337Jean Bertoin. Two-Parameter Poisson-Dirichlet Measures and Reversible Exchangeable Fragmentation-Coalescence Processes
339 -- 345Arturas Dubickas. An Approximation by Lacunary Sequence of Vectors
347 -- 361Shmuel Friedland, Leonid Gurvits. Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer-Dimer Entropy
363 -- 387W. T. Gowers. Quasirandom Groups
389 -- 410Carlos Hoppen, Nicholas C. Wormald. Induced Forests in Regular Graphs with Large Girth
411 -- 422Daniela Kühn, Deryk Osthus. Linkedness and Ordered Cycles in Digraphs
423 -- 435Charles Semple, Dominic Welsh. Negative Correlation in Graphs and Matroids
437 -- 470J. I. M. X. Zhang, Paul Dupuis. Large-Deviation Approximations for General Occupancy Models

Volume 17, Issue 2

161 -- 202Nicolas Broutin, Luc Devroye. An Analysis of the Height of Tries with Random Weights on the Edges
203 -- 224Adrian Dumitrescu, Csaba D. Tóth. On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space
225 -- 238Roberto Fernández, Aldo Procacci. Regions Without Complex Zeros for Chromatic Polynomials on Graphs with Bounded Degree
239 -- 257Raymond Hemmecke, Jason Morton, Anne Shiu, Bernd Sturmfels, Oliver Wienand. Three Counter-Examples on Semi-Graphoids
259 -- 264Svante Janson, Andrew Thomason. Dismantling Sparse Random Graphs
265 -- 270Hal A. Kierstead, Alexandr V. Kostochka. A Short Proof of the Hajnal-Szemerédi Theorem on Equitable Colouring
271 -- 286Po-Shen Loh, Benny Sudakov. On the Strong Chromatic Number of Random Graphs
287 -- 295Vadim V. Lozin. Boundary Classes of Planar Graphs
297 -- 305T. Sanders. A Note on Freiman s Theorem in Vector Spaces
307 -- 316R. O. Y. Wagner. Tail Estimates for Sums of Variables Sampled by a Random Walk
317 -- 318Hans-Otto Georgii. ::::The Random-Cluster Model::::, by Geoffrey Grimmett, Springer, 2006

Volume 17, Issue 1

1 -- 19Alexander I. Barvinok. Enumerating Contingency Tables via Random Permanents
21 -- 59Frédéric Chyzak, Michael Drmota, Thomas Klausner, Gerard Kok. The Distribution of Patterns in Random Trees
61 -- 66Yahya Ould Hamidoune. On Iterated Image Size for Point-Symmetric Relations
67 -- 86Mihyun Kang, Taral Guldahl Seierstad. The Critical Phase for Random Graphs with a Given Degree Sequence
87 -- 110Roberto Oliveira. Balls-in-Bins Processes with Feedback and Brownian Motion
111 -- 136Oliver Riordan. The k-Core and Branching Processes
137 -- 159Vincent Vatter. Enumeration Schemes for Restricted Permutations