Journal: Combinatorics, Probability & Computing

Volume 6, Issue 4

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

Volume 6, Issue 3

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

Volume 6, Issue 2

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

Volume 6, Issue 1

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