{"paper":{"title":"Almost partitioning 2-coloured complete 3-uniform hypergraphs into two monochromatic tight or loose cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hiep Han, Maya Stein, Sebastian Bustamante","submitted_at":"2017-01-26T18:32:28Z","abstract_excerpt":"We show that for every {\\eta} > 0 there exists an integer n_0 such that every 2-colouring of the 3-uniform complete hypergraph on n \\geq n_0 vertices contains two disjoint monochromatic tight cycles of distinct colours that together cover all but at most {\\eta}n vertices. The same result holds if we replace tight cycles with loose cycles."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07806","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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"}