External Links

    Journal: Combinatorics, Probability & Computing

    Volume 11, Issue 6

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

    Volume 11, Issue 5

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

    Volume 11, Issue 4

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

    Volume 11, Issue 3

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

    Volume 11, Issue 2

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

    Volume 11, Issue 1

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