Designing Progressive Dinner Parties
Combinatorics
2020-03-19 v2
Abstract
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.
Cite
@article{arxiv.2001.05394,
title = {Designing Progressive Dinner Parties},
author = {Douglas R. Stinson},
journal= {arXiv preprint arXiv:2001.05394},
year = {2020}
}
Comments
revised version corrects a few small typos and removes the exception in Theorem 3.7