
Chris D. Godsil:
Walk Generating Functions, Christoffel-Darboux Identities and the Adjacency Matrix of a Graph. 13-25
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
Victor Bryant:
A Characterisation of Strict Matching Matroids. 209-217
Guoping Jin:
Complete Subgraphs of r-partite Graphs. 241-250
Tamás F. Móri:
Maximum Waiting Times are Asymptotically Independent. 251-264
Geoff Whittle:
Duality in Polymatroids and Set Functions. 275-280
David Aldous:
Greedy Search on the Binary Tree with random Edge-Weights. 281-293
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
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