This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Next revisionBoth sides next revision |
| table_seating [2021-06-12 12:02] – nik | table_seating [2021-06-12 12:02] – nik |
|---|
| 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]]} | 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://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|ref]]}/jcd.10024?saml_referrer | [[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]]} |
| 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]] | 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]] |
| |
nik