{"paper":{"title":"A complete solution to the generalized honeymoon Oberwolfach problem with one round table","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Masoomeh Akbari","submitted_at":"2026-07-01T16:15:54Z","abstract_excerpt":"The generalized honeymoon Oberwolfach problem (HOP) asks whether it is possible to seat $2n$ participants consisting of $n$ newlywed couples at a conference with $s$ tables of size $2$ and $t$ \"round'' tables of sizes $2m_1, 2m_2, \\ldots, 2m_t$, where $n = s + \\sum_{i=1}^{t} m_i $ with all $m_i \\geq 2$, over several nights so that each participant sits next to their spouse every time and next to each other participant exactly once. We denote this problem by $HOP(2^{\\langle s \\rangle}, 2m_1, \\ldots, 2m_t)$. In this paper, we provide a complete solution to the generalized HOP with one round tabl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.01130","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.01130/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}