Combinatorics, Probability & Computing, Volume 9, 2000

Volume 9, Number 1, 2000

• Hanna D. Robalewska, Nicholas C. Wormald: Random Star Processes.
• Noga Alon, Benny Sudakov: Bipartite Subgraphs And The Smallest Eigenvalue.
• Van H. Vu: On The Choice Number Of Random Hypergraphs.
• Michael Krivelevich: The Choice Number Of Dense Random Graphs.
• David Reimer: Proof Of The Van Den Berg-Kesten Conjecture.
• C. R. Subramanian: Algorithms For Colouring Random K-Colourable Graphs.
• Alexander V. Gnedin: A Note On Sequential Selection From Permutations.

Volume 9, Number 2, 2000

• Lori Fern, Gary Gordon, Jason Leasure, Sharon Pronchik: Matroid Automorphisms And Symmetry Groups.
• Oliver Riordan: Spanning Subgraphs Of Random Graphs.
• David G. Wagner: Zeros Of Reliability Polynomials And F-Vectors Of Matroids.
• Yoav Seginer: The Expected Norm Of Random Matrices.
• J. Keith Dugdale, Anthony J. W. Hilton: A Sufficient Condition For A Graph To Be The Core Of A Class 2 Graph.

Volume 9, Number 3, 2000

• Miguel Angel Fiol, Ernest Garriga, J. Luis A. Yebra: On Twisted Odd Graphs.
• John Mount: Fast Unimodular Counting.
• Noga Alon, Miklós Bóna, Joel Spencer: Packing Ferrers Shapes.
• Nikolai N. Kuzjurin: Explicit Constructions Of Rödl's Asymptotically Good Packings And Coverings.
• Martin Anthony, Peter L. Bartlett: Function Learning From Interpolation.
• Alan M. Frieze, Lei Zhao: Optimal Construction Of Edge-Disjoint Paths In Random Regular Graphs.

Volume 9, Number 4, 2000

• Margit Voigt: Algorithmic Aspects Of Partial List Colourings.
• Yair Caro, Raphael Yuster: Dominating A Family Of Graphs With Small Connected Subgraphs.
• Benjamin Doerr: Linear And Hereditary Discrepancy.
• Sándor Csörgo, Wei Biao Wu: Random Graphs And The Strong Convergence Of Bootstrap Means.
• Daniel Barraez, Stéphane Boucheron, Wenceslas Fernandez de la Vega: On The Fluctuations Of The Giant Component.
• Joseph P. S. Kung: Critical Exponents, Colines, And Projective Geometries.
• Eunice Gogo Mphako: Tutte Polynomials Of Perfect Matroid Designs.
• Joseph E. Bonin: Involutions Of Connected Binary Matroids.
• Jacques Verstraëte: On Arithmetic Progressions Of Cycle Lengths In Graphs.

Volume 9, Number 5, 2000

• Shai Ben-David, Leonid Gurvits: A Note On Vc-Dimension And Measure Of Sets Of Reals.
• Olle Häggström, Jeffrey E. Steif: Propp-Wilson Algorithms And Finitary Codings For High Noise Markov Random Fields.
• Noga Alon, János Körner, Angelo Monti: String Quartets In Binary.
• Péter Gács: The Clairvoyant Demon Has A Hard Task.
• Joseph E. Bonin, Talmage James Reid: Simple Matroids With Bounded Cocircuit Size.
• Gregory F. Lawler, Emily E. Puckette: The Intersection Exponent For Simple Random Walk.
• Jean-Pierre Tillich, Gilles Zémor: Discrete Isoperimetric Inequalities And The Probability Of A Decoding Error.

Volume 9, Number 6, 2000

• Pawel Hitczenko, Gilbert Stengle: Expected Number Of Distinct Part Sizes In A Random Integer Composition.
• Robin Thomas, Jan Mcdonald Thomson: Excluding Minors In Nonplanar Graphs Of Girth At Least Five.
• Josep Díaz, Mathew D. Penrose, Jordi Petit, Maria J. Serna: Convergence Theorems For Some Layout Measures On Random Lattice And Random Geometric Graphs.
• Marianne Månsson: On Compound Poisson Approximation For Sequence Matching.
• Oliver Riordan, Alex Selby: The Maximum Degree Of A Random Graph.
• Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra: On Restricted Sums.
• Noga Alon, Emanuela Fachini, János Körner: Locally Thin Set Families.