Combinatorics, Probability & Computing, Volume 11, 2002

Volume 11, Number 1, 2002

André E. Kézdy, Hunter S. Snevily: Distinct Sums Modulo N And Tree Embeddings.
Van H. Vu: A General Upper Bound On The List Chromatic Number Of Locally Sparse Graphs.
Jacques Verstraëte: A Note On Vertex-Disjoint Cycles.
Leslie Ann Goldberg, Mark Jerrum: The "Burnside Process" Converges Slowly.
Vivek S. Borkar: On The Lock-In Probability Of Stochastic Approximation.
Noga Alon, Bojan Mohar: The Chromatic Number Of Graph Powers.
Orlando Lee, Yoshiko Wakabayashi: On The Circuit Cover Problemfor Mixed Graphs.
Dudley Stark, A. Ganesh, Neil O'Connell: Information Loss In Riffle Shuffling.
Eugenijus Manstavicius: Mappings On Decomposable Combinatorial Structures: Analytic Approach.

Bogdan Oporowski: Partitioning Matroids With Only Small Cocircuits.
Vladimir Nikiforov: Some Inequalities For The Largest Eigenvalue Of A Graph.
Grzegorz Kubicki, Jenö Lehel, Michal Morayne: A Ratio Inequality For Binary Trees And The Best Secretary.
Colin Cooper, Alan M. Frieze: Multi-Coloured Hamilton Cycles In Random Edge-Coloured Graphs.
Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Gabriel Istrate, Mark Jerrum: Convergence Of The Iterated Prisoner's Dilemma Game.
Stéphane Boucheron, Wenceslas Fernandez de la Vega: On A Square Packing Problem.
John M. Talbot: Lagrangians Of Hypergraphs.
Colin McDiarmid: Concentration For Independent Permutations.

Dhruv Mubayi: Some Exact Results And New Asymptotics For Hypergraph Turán Numbers.
Catherine S. Greenhill, Svante Janson, Jeong Han Kim, Nicholas C. Wormald: Permutation Pseudographs And Contiguity.
Edward Dobson: Packing Trees Into The Complete Graph.
Colin Cooper, Alan M. Frieze, Bruce A. Reed: Random Regular Graphs Of Non-Constant Degree: Connectivity And Hamiltonicity.
Sven Erick Alm, Gregory B. Sorkin: Exact Expectations And Distributions For The Random Assignment Problem.
Gary K. Schwartz: On The Automorphism Groups Of Dowling Geometries.

Edward Dobson: Constructing Trees In Graphs Whose Complement Has No K2, S.
Hsien-Kuei Hwang, Tsung-Hsi Tsai: Quickselect And The Dickman Function.
Klaus Dohmen: Bonferroni-Type Inequalities Via Chordal Graphs.
James G. Oxley, Dominic J. A. Welsh: Chromatic, Flow And Reliability Polynomials: The Complexity Of Their Coefficients.
Marianne Månsson: Pattern Avoidance And Overlap In Strings.
András Telcs: A Note On Rough Isometry Invariance Of Resistance.
Brendan D. McKay, Ian M. Wanless, Nicholas C. Wormald: Asymptotic Enumeration Of Graphs With A Given Upper Bound On The Maximum Degree.
Colin Cooper, Alan M. Frieze, Bruce A. Reed, Oliver Riordan: Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number.

Jim Pitman: Poisson-Dirichlet And Gem Invariant Distributions For Split-And-Merge Transformations Of An Interval Partition.
Michael Krivelevich, Benny Sudakov, Van H. Vu: A Sharp Threshold For Network Reliability.
Robert Beals, Charles R. Leedham-Green, Alice C. Niemeyer, Cheryl E. Praeger, Ákos Seress: Permutations With Restricted Cycle Structure And An Algorithmic Application.
Samuel Kutin: Constructing Large Set Systems With Given Intersection Sizes Modulo Composite Numbers.
Sven Erick Alm, Robert Parviainen: Lower And Upper Bounds For The Time Constant Of First-Passage Percolation.
Daniel C. Slilaty: Matroid Duality From Topological Duality In Surfaces Of Nonnegative Euler Characteristic.
Elchanan Mossel: The Minesweeper Game: Percolation And Complexity.
Wolfgang Stadje: The Residues Modulo M Of Products Of Random Integers.

Christian M. Reidys: Distances In Random Induced Subgraphs Of Generalized N-Cubes.
Joseph Samuel Myers: Graphs Without Large Complete Minors Are Quasi-Random.
Ralph Neininger: The Wiener Index Of Random Trees.
Stasys Jukna, Georg Schnitger: Triangle-Freeness Is Hard To Detect.
John C. Wierman: An Improved Upper Bound For The Hexagonal Lattice Site Percolation Critical Probability.
Patrick Bellenbaum, Reinhard Diestel: Two Short Proofs Concerning Tree-Decompositions.
Dudley Stark: Information Loss In Top To Random Shuffling.