Seat Arrangement Problems

Vites Longani, Hatairat Yingtaweesittikul

Authors

  • Support Team

Abstract

Let there be n students, and n row seats. For n days, a seat is arranged for each student on each day, and each student is required to sit on different seat on each of the n days. Also for these n days, it is required that each student shall has one chance to sit next to every other (n-1) students on one of his side, and shall has one chance to sit next to every other (n-1) students on the other one of his side. In this paper, we provide sufficient conditions and an algorithm for the arrangements.

Downloads

Published

2016-08-01

How to Cite

Team, S. (2016). Seat Arrangement Problems: Vites Longani, Hatairat Yingtaweesittikul. Thai Journal of Mathematics, 14(2), 383–390. Retrieved from https://thaijmath2.in.cmu.ac.th/index.php/thaijmath/article/view/604

Issue

Section

Articles