Combinatorics, Probability & Computing, Volume 10, 2001

Volume 10, Number 1, 2001

• Van H. Vu: A Large Deviation Result On The Number Of Small Subgraphs Of A Random Graph.
• Andreas Nolte, Rainer Schrader: Simulated Annealing And Graph Colouring.
• Christian Houdré, Prasad Tetali: Concentration Of Measure For Products Of Markov Kernels And Graph Products Via Functional Inequalities.
• Alan D. Sokal: Bounds On The Complex Zeros Of (Di)Chromatic Polynomials And Potts-Model Partition Functions.

Volume 10, Number 2, 2001

• Hans Jürgen Prömel, Angelika Steger, Anusch Taraz: Counting Partial Orders With A Fixed Number Of Comparable Pairs.
• Paul Balister: On The Alspach Conjecture.
• Miguel Angel Fiol: Some Spectral Characterizations Of Strongly Distance-Regular Graphs.
• Hongxun Qin: Connected Matroids With Symmetric Tutte Polynomials.
• Jeff Kahn, János Komlós: Singularity Probabilities For Random Matrices Over Finite Fields.

Volume 10, Number 5, 2001

• Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma: G-Intersecting Families.
• Stéphane Boucheron, Wenceslas Fernandez de la Vega: On The Independence Number Of Random Interval Graphs.
• R. E. Lillo, M. Martin: Characterization Results Based On A Functional Derivative Approach.
• János Komlós, Gábor N. Sárközy, Endre Szemerédi: Spanning Trees In Dense Graphs.
• Talmage James Reid, Haidong Wu: On Minimally 3-Connected Binary Matroids.

Volume 10, Number 6, 2001

• Paul Balister: Packing Circuits Into KN.
• Emanuela Fachini, János Körner: A Note On Counting Very Different Sequences.
• Stefan T. Mecay: Maximum-Sized Matroids With No Minors Isomorphic To U2, 5, F7, F^-7 Or P7.
• Vladimir Nikiforov: On The Edge Distribution Of A Graph.
• Tibor Szabó, Gábor Tardos: A Multidimensional Generalization Of The Erdös-Szekeres Lemma On Monotone Subsequences.
• Jan van den Heuvel: Algorithmic Aspects Of A Chip-Firing Game.