Abstract
We exhibit a combinatorial model based on seating rearrangements, motivated by some problems proposed in the 1990s by Kennedy, Cooper, and Honsberger. We provide a simpler interpretation of their results on rectangular grids, and then generalize the model to arbitrary graphs. This generalization allows us to pose a variety of well-motivated counting problems on other frequently studied families of graphs.
Citation
Daryl DeFord. "Seating rearrangements on arbitrary graphs." Involve 7 (6) 787 - 805, 2014. https://doi.org/10.2140/involve.2014.7.787
Information
