{"paper":{"title":"The $r$-matching sequencibility of complete multi-$k$-partite $k$-graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam Mammoliti","submitted_at":"2019-05-10T06:02:21Z","abstract_excerpt":"Alspach [{\\sl Bull. Inst. Combin. Appl.}~{\\bf 52} (2008), 7--20] defined the maximal matching sequencibility of a graph $G$, denoted~$ms(G)$, to be the largest integer $s$ for which there is an ordering of the edges of $G$ such that every $s$ consecutive edges form a matching. In this paper, we consider the natural analogue for hypergraphs of this and related results and determine $ms(\\lambda\\mathcal{K}_{n_1,\\ldots, n_k})$ where $\\lambda\\mathcal{K}_{n_1,\\ldots, n_k}$ denotes the multi-$k$-partite $k$-graph with edge multiplicity $\\lambda$ and parts of sizes $n_1,\\ldots,n_k$, respectively. It t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03953","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":""},"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"}