2020/01/15 by Douglas R. Stinson, Stinson, Douglas R.
Mathematics · #05B15 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05B15
paper · pdf · doi:10.48550/arxiv.2001.05394
revised version corrects a few small typos and removes the exception in Theorem 3.7
arxiv created 2020/03/17 · arxiv updated 2020/03/19
I recently came across a combinatorial design problem involving progressive dinner parties (also known as safari suppers). In this note, I provide some elementary methods of designing schedules for these kinds of dinner parties.