Journal: Combinatorics, Probability & Computing

Volume 19, Issue 5-6

641 -- 0Noga Alon, Béla Bollobás. Introduction
643 -- 692József Balogh, Béla Bollobás, Robert Morris. Bootstrap Percolation in High Dimensions
693 -- 709Artur Czumaj, Christian Sohler. Testing Expansion in Bounded-Degree Graphs
711 -- 728Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel. Tight Bounds for Blind Search on the Integers and the Reals
729 -- 751Jian Ding, Jeong Han Kim, Eyal Lubetzky, Yuval Peres. Diameters in Supercritical Random Graphs Via First Passage Percolation
753 -- 774Jacob Fox, Benny Sudakov. Decompositions into Subgraphs of Small Diameter
775 -- 790Andreas Goerdt. On Random Betweenness Constraints
791 -- 817Catherine S. Greenhill, Svante Janson, Andrzej Rucinski. On the Number of Perfect Matchings in Random Lifts
819 -- 827Tomasz Luczak, Andrew Thomason. Vicarious Graphs
829 -- 834Yuri Matiyasevich. One More Probabilistic Reformulation of the Four Colour Conjecture
835 -- 926Oliver Riordan, Nicholas C. Wormald. The Diameter of Sparse Random Graphs