Differences

This shows you the differences between two versions of the page.

--- table_seating [2021-06-12 11:59] – created nik
+++ table_seating [2021-06-12 12:03] – nik
@@ Line 7: / Line 7: @@
-Strict versions include Kirkman's Schoolgirl Problem (15 children walk in groups of 3, can they do this so that all pairs of girls walk together exactly once over a whole week)
+Strict versions include [[https://en.wikipedia.org/wiki/Kirkman%27s_schoolgirl_problem|Kirkman's Schoolgirl Problem]] (15 children walk in groups of 3, can they do this so that all pairs of girls walk together exactly once over a whole week) {[[https://oeis.org/search?q=schoolgirl&sort=&language=german&go=Suche|oeis]]}
-  - https://en.wikipedia.org/wiki/Kirkman%27s_schoolgirl_problem
-  - https://oeis.org/search?q=schoolgirl&sort=&language=german&go=Suche
 In less strict cases we allow people to meet more often, or not to meet.
-The "Dagstuhl Happy Diner problem" is the version where everyone meets at least once.
+The "[[https://github.com/fpvandoorn/Dagstuhl-tables|Dagstuhl Happy Diner problem]]" is the version where everyone meets at least once. {[[https://oeis.org/A318240|oeis]]}
-  - https://github.com/fpvandoorn/Dagstuhl-tables
-  - https://oeis.org/A318240
-Equitable Resolvable coverings also seem to be a more strict form, where we can allow people to meet at most twice.
+[[https://www.researchgate.net/publication/227715273_Equitable_resolvable_coverings|Equitable Resolvable coverings]] also seem to be a more strict form, where we can allow people to meet at most twice. {[[https://onlinelibrary.wiley.com/doi/epdf/10.1002/jcd.10024|ref]]}
-  - https://www.researchgate.net/publication/227715273_Equitable_resolvable_coverings
-  - https://onlinelibrary.wiley.com/doi/epdf/10.1002/jcd.10024?saml_referrer
 If we have people sitting at round tables and only interacting with their neighbours, then we have the more difficult [[https://en.wikipedia.org/wiki/Oberwolfach_problem|Oberwolfach Problem]]