Connections in discrete mathematics: a celebration of the work of Ron Graham

Content: 1. Probabilizing Fibonacci numbers Persi Diaconis
 2. On the number of ON cells in cellular automata N. J. A. Sloane
 3. Search for ultraflat polynomials with plus and minus one coefficients Andrew Odlyzko
 4. Generalized Goncharov polynomials Rudolph Lorenz, Salvatore Tringall and Catherine H. Yan
 5. The digraph drop polynomial Fan Chung and Ron Graham
 6. Unramified graph covers of finite degree Hau-Wen Huang and Wen-Ching Winnie Li
 7. The first function and its iterates Carl Pomerance
 8. Erdos, Klarner, and the 3x + 1 problem Jeffrey C. Lagarias
 9. A short proof for an extension of the Erdos-Ko-Rado theorem Peter Frankl and Andrey Kupavskii
 10. The Haight-Ruzsa method for sets with more differences than multiple sums Melvyn B. Nathanson
 11. Dimension and cut vertices William T. Trotter, Bartosz Walczak and Ruidong Wang
 12. Recent results on partition regularity of infinite matrices Neil Hindman
 13. Some remarks on pi Christian Reiher, Vojtech Rodl and Mathias Schacht
 14. Ramsey classes with closure operations Jan Hubicka and Jaroslav Nesetril
 15. Borsuk and Ramsey type questions in Euclidean space Peter Frankl, Janos Pach, Christian Reiher and Vojtech Rodl
 16. Pick's theorem and sums of lattice points Karl Levy and Melvyn B. Nathanson
 17. Apollonian ring packings Adrian Bolt, Steve Butler and Espen Hovland
 18. Juggling and card shuffling meet mathematical fonts Erik D. Demaine and Martin L. Demaine
 19. Randomly juggling backwards Allen Knutson
 20. Explicit error bounds for lattice Edgeworth expansions J. P. Buhler, A. C. Gamst, Ron Graham and Alfred W. Hales.