How Expressive Are Friendly School Partitions?
Josef Mina\v{r}\'ik, Shay Moran, Michael Skotnica

TL;DR
This paper investigates the complexity and properties of 'friendly' student partitions in school class assignments, analyzing their existence, quantity, and separability under various constraints.
Contribution
It establishes existence results for friendly partitions and student separability, and explores the limits of their expressiveness under different conditions.
Findings
At least two friendly partitions exist when each student lists at least 3 peers.
A student can be separated from any other when each lists at least 15 peers.
Open questions remain about pairwise separability and conditions for universal separation.
Abstract
A natural procedure for assigning students to classes in the beginning of the school-year is to let each student write down a list of other students with whom she/he wants to be in the same class (typically ). The teachers then gather all the lists and try to assign the students to classes in a way that each student is assigned to the same class with at least one student from her/his list. We refer to such partitions as friendly. In realistic scenarios, the teachers may also consider other constraints when picking the friendly partition: e.g. there may be a group of students whom the teachers wish to avoid assigning to the same class; alternatively, there may be two close friends whom the teachers want to put together; etc. Inspired by such challenges, we explore questions concerning the expressiveness of friendly partitions. For example: Does there always exist a friendly…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Advanced Graph Theory Research · graph theory and CDMA systems
