dblp: Combinatorics, Probability & Computing, Volume 1

László Babai, Mario Szegedy: Local Expansion of Ssymmetrical Graphs. 1-11

Chris D. Godsil: Walk Generating Functions, Christoffel-Darboux Identities and the Adjacency Matrix of a Graph. 13-25

Roland Häggkvist: On the structure of Non-Hamiltonian Graphs 1. 27-34

Tomasz Luczak, Boris Pittel: Componenets of Random Forests. 35-52

Hans Jürgen Prömel, Angelika Steger: Almost all Berge Graphs are Perfect. 53-79

Joel Spencer, Peter Winkler: Three Thresholds for a Liar. 81-93

John C. Wierman: Equality of the Bond Percolation Critical Exponents for Two Pairs of Dual Lattices. 95-105

Noga Alon: Choice Numbers of Graphs: a Probabilistic Approach. 107-114

A. Robert Calderbank, Peter Frankl: Improved Upper Bounds Concerning the Erdös-Ko-Rado Theorem. 115-122

Neil J. Calkin, Alan M. Frieze, Brendan D. McKay: On Subgraph Sizes in Random Graphs. 123-134

Persi Diaconis, James Allen Fill, Jim Pitman: Analysis of Top To Random Shuffles. 135-155

Colin McDiarmid: On a Correlation Inequality of Farr. 157-160

Ora Engelberg Percus, Jerome K. Percus: An Expanded Set of Correlation Tests for Linear Congruential Random Number Generators. 161-168

Andrzej Rucinski, Nicholas C. Wormald: Random Graph Processes with Degree Restrictions. 169-180

Dirk Vertigan, Dominic J. A. Welsh: The Compunational Complexity of the Tutte Plane: the Bipartite Case. 181-187

Noga Alon, Imre Bárány, Zoltán Füredi, Daniel J. Kleitman: Point Selections and Weak e-Nets for Convex Hulls. 189-200

László Babai, Gábor Hetyei: On the Diameter of Random Cayley Graphs of the Symmetric Group. 201-208

Victor Bryant: A Characterisation of Strict Matching Matroids. 209-217

Y. Fan, Jerome K. Percus: Duality for Random Sequential Adsorption on a Lattice. 219-222

Jerzy Jaworski, Tomasz Luczak: Cycles in a Uniform Graph Process. 223-239

Guoping Jin: Complete Subgraphs of r-partite Graphs. 241-250

Tamás F. Móri: Maximum Waiting Times are Asymptotically Independent. 251-264

Bruce A. Reed, Colin McDiarmid: The Strongly Connected Components of 1-in, 1-out. 265-274

Geoff Whittle: Duality in Polymatroids and Set Functions. 275-280

David Aldous: Greedy Search on the Binary Tree with random Edge-Weights. 281-293

Imre Bárány, János Pach: On the Number of Convex Lattice Polygons. 295-302

Colin Cooper: On the Trickness of Sparse Random Graphs. 303-309

János A. Csirik: Optimal Strategy for the First Player in the Penney Ante Game. 311-321

Péter L. Erdös, Ulrich Faigle, Walter Kern: A Group-Theoretic Setting for Some Intersecting Sperner Families. 323-334

Alex D. Scott: Large Induced Subgraphs with All Degrees Odd. 335-349

Alistair Sinclair: Improved Bounds for Mixing Rates of Marcov Chains and Multicommodity Flow. 351-370

Carsten Thomassen: Plane Cubic Graphs with Prescribed Face Areas. 371-381

Combinatorics, Probability & Computing, Volume 1, 1992