Combinatorics, Probability & Computing, Volume 6, 1997

Volume 6, Number 1, March 1997

Andrew D. Barbour, Anant P. Godbole, Jinghua Qian: Imperfections in Random Tournaments. 1-15
Edward A. Bender, E. Rodney Canfield, Zhicheng Gao, L. Bruce Richmond: Submap Density and Asymmetry Results for Two Parameter Map Families. 17-25
Laurent Decreusefond, Gilles Zémor: On the Error-Correcting Capabilities of Cycle Codes of Graphs. 27-38
Tristan Denley: On a Result of Lemke and Kleitman. 39-43
Kimmo Eriksson: Autocorrelation and the Enumeration of Strings Avoiding a Fixed String. 45-48
Andrew S. Greenhalgh: A Model for Random Random-Walks on Finite Groups. 49-56
Ulrich Martin Hirth: Probabilistic Number Theory, the GEM/Poisson-Dirichlet Distribution and the Arc-sine Law. 57-77
Colin McDiarmid: Centering Sequences with Bounded Differences. 79-86
Dudley Stark: Explicit Limits of Total Variation Distance in Approximations of Random Logarithmic Assemblies by Related Poisson Processes. 87-105
Pou-Lin Wu: An Upper Bound on the Number of Edges of a 2-Connected Graph. 107-113
Raphael Yuster: Independent Transversals and Independent Coverings in Sparse Partite Graphs. 115-125

Rudolf Ahlswede, Noga Alon, Péter L. Erdös, Miklós Ruszinkó, László A. Székely: Intersecting Systems. 127-137
S. Alesker: A Remark on the Szarek-Talagrand Theorem. 139-144
Noga Alon: On the Edge-Expansion of Graphs. 145-152
Ernest J. Cockayne, Christina M. Mynhardt: Irredundance and Maximum Degree in Graphs. 153-157
Lenore Cowen, Rudolf Mathar: The Offset Problem. 159-164
Davide Crippa, Klaus Simon, Paul Trunz: Markov Processes Involving q-Stirling Numbers. 165-178
Peter J. Grabner, Helmut Prodinger: Maximum Statistics of N Random Variables Distributed by the Negative Binomial Distribution. 179-183
Ulrich Martin Hirth: From GEM back to Dirichlet via Hoppe's Urn. 185-195
Irene Hueter, Yuval Peres: Self-Affine Carpets on the Square Lattice. 197-204
Luc Pronzato, Henry P. Wynn, Anatoly A. Zhigljavsky: Stochastic Analysis of Convergence via Dynamic Representation for a Class of Line-search Algorithms. 205-229
Farnk Vogt, Bernd Voigt: Symmetric Chain Decompositions of Linear Lattices. 231-245
Van H. Vu: On a Theorem of Ganter. 247-254

Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo: Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments. 255-261
Neil J. Calkin: Dependent Sets of Constant Weight Binary Vectors. 263-271
Charles M. Grinstead: On Medians of Lattice Distributions and a Game with Two Dice. 273-294
Roland Häggkvist, Jeannette Janssen: New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs. 295-313
Jennie C. Hansen: Limit Laws for the Optimal Directed Tree with Random Costs. 315-335
Michael Krivelevich: Triangle Factors in Random Graphs. 337-347
Vojtech Rödl, Andrzej Rucinski: Bipartite Coverings of Graphs. 349-352
László A. Székely: Crossing Numbers and Hard Erd[odblac]s Problems in Discrete Geometry. 353-358
B. Tóth, W. Werner: Tied Favourite Edges for Simple Random Walk. 359-369
Ekkehard Weineck: Log-Concavity and the Spectral Gap of Stochastic Matrices. 370-375

C. C. Chen, G. P. Jin, K. M. Koh: Triangle-Free Graphs with Large Degree. 381-396
Hervé Daudé, Philippe Flajolet, Brigitte Vallée: An Average-Case Analysis of the Gaussian Algorithm for Lattice Reduction. 397-433
James Allen Fill, Robert P. Dobrow: The Number of m-ary Search Trees on n Keys. 435-453
Peter Firby, Julie Haviland: Maximal Spacing Configurations in Graphs. 455-463
Nabil Kahale: Large Deviation Bounds for Markov Chains. 465-474
Ulrich Matthias: Constructive Upper Bounds for the Turán Number. 475-479
Attila Sali, Gábor Simonyi: Recovering Set Systems and Graph Entropy. 481-491
Miroslav Tanushev, Richard Arratia: A Note on Distributional Equality in the Cyclic Tour Property for Markov Chains. 493-496
Carsten Thomassen: The Zero-Free Intervals for Chromatic Polynomials of Graphs. 497-506