1. Fractional covers and matchings in families of weighted d-intervals

   • Ron Aharoni
   • Tomáš Kaiser
   • Shira Zerbib

   Original paper 10 August 2016 Pages: 555 - 572

2. Powers of Hamilton cycles in pseudorandom graphs

   • Peter Allen
   • Julia Böttcher
   • Yury Person

   Original paper 22 December 2016 Pages: 573 - 616

3. The typical structure of graphs with no large cliques

   • József Balogh
   • Neal Bushaw
   • Maryam Sharifzadeh

   Original paper 10 May 2016 Pages: 617 - 632

4. Computing the partition function for graph homomorphisms

   • Alexander Barvinok
   • Pablo Soberón

   Original paper 10 May 2016 Pages: 633 - 650

5. Regular families of forests, antichains and duality pairs of relational structures

   • Péter L. Erdős
   • Dömötör Pálvölgyi
   • Gábor Tardos

   Original paper 10 May 2016 Pages: 651 - 672

6. Generalising Fisher’s inequality to coverings and packings

   • Daniel Horsley

   Original paper 17 October 2016 Pages: 673 - 696

7. Compatible Hamilton cycles in Dirac graphs

   • Michael Krivelevich
   • Choongbum Lee
   • Benny Sudakov

   Original paper 16 September 2016 Pages: 697 - 732

8. Lifts, derandomization, and diameters of Schreier graphs of Mealy automata

   • Anton Malyshev
   • Igor Pak

   Original paper 24 March 2017 Pages: 733 - 765

9. An exponential-type upper bound for Folkman numbers

   • Vojtěch Rödl
   • Andrzej Ruciński
   • Mathias Schacht

   Original paper 10 May 2016 Pages: 767 - 784

10. Infinitely connected subgraphs in graphs of uncountable chromatic number

    • Carsten Thomassen

    Original paper 10 May 2016 Pages: 785 - 793