| 391 | -- | 412 | Dan Hefetz, Michael Krivelevich, Tibor Szabó. Sharp threshold for the appearance of certain spanning trees in random graphs |
| 413 | -- | 440 | József Balogh, Béla Bollobás, Robert Morris. Graph bootstrap percolation |
| 441 | -- | 450 | Béla Bollobás, Oliver Riordan. Asymptotic normality of the size of the giant component in a random hypergraph |
| 451 | -- | 468 | Fan Chung Graham, Stephen J. Young, Wenbo Zhao. Braess's paradox in expanders |
| 469 | -- | 487 | B. Demarco, J. Kahn. Tight upper tail bounds for cliques |
| 488 | -- | 505 | Luca Gugelmann, Yury Person, Angelika Steger, Henning Thomas. A randomized version of Ramsey's theorem |
| 506 | -- | 520 | Frantisek Kardos, Daniel Král', Jan Volec. Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs |
| 521 | -- | 545 | Linyuan Lu, Xing Peng. Loose laplacian spectra of random hypergraphs |
| 546 | -- | 556 | Wesley Pegden. The lefthanded local lemma characterizes chordal dependency graphs |
| 557 | -- | 573 | Vojtech Rödl, Mathias Schacht. Complete Partite subgraphs in dense hypergraphs |