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. BibTeX
Van H. Vu: A General Upper Bound On The List Chromatic Number Of Locally Sparse Graphs. BibTeX
Jacques Verstraëte: A Note On Vertex-Disjoint Cycles. BibTeX
Leslie Ann Goldberg, Mark Jerrum: The "Burnside Process" Converges Slowly. BibTeX
Vivek S. Borkar: On The Lock-In Probability Of Stochastic Approximation. BibTeX
Noga Alon, Bojan Mohar: The Chromatic Number Of Graph Powers. BibTeX
Orlando Lee, Yoshiko Wakabayashi: On The Circuit Cover Problemfor Mixed Graphs. BibTeX
Dudley Stark, A. Ganesh, Neil O'Connell: Information Loss In Riffle Shuffling. BibTeX
Eugenijus Manstavicius: Mappings On Decomposable Combinatorial Structures: Analytic Approach. BibTeX

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

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

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

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

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