1. On the non-existence of pair covering designs with at least as many points as blocks

   • Darryn Bryant
   • Melinda Buchanan
   • Victor Scharaschkin

   OriginalPaper 23 November 2011 Pages: 507 - 528

2. Poset limits and exchangeable random posets

   • Svante Janson

   OriginalPaper 26 November 2011 Pages: 529 - 563

3. On the threshold for k-regular subgraphs of random graphs

   • Paweł Prałat
   • Jacques Verstraëte
   • Nicholas Wormald

   OriginalPaper 23 November 2011 Pages: 565 - 581

4. The unbounded-error communication complexity of symmetric functions

   • Alexander A. Sherstov

   OriginalPaper 23 November 2011 Pages: 583 - 614

5. Generalized Veronesean embeddings of projective spaces

   • Joseph A. Thas
   • Hendrik Van Maldeghem

   OriginalPaper 23 November 2011 Pages: 615 - 629