{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FMFIPKQS2TKTFY5XYTB5SYSFXE","short_pith_number":"pith:FMFIPKQS","schema_version":"1.0","canonical_sha256":"2b0a87aa12d4d532e3b7c4c3d96245b91263ecf1e3ec04581156141c6f5bc4e0","source":{"kind":"arxiv","id":"1406.3229","version":2},"attestation_state":"computed","paper":{"title":"On directed versions of the Hajnal--Szemer\\'edi theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Treglown","submitted_at":"2014-06-12T13:11:38Z","abstract_excerpt":"We say that a (di)graph $G$ has a perfect $H$-packing if there exists a set of vertex-disjoint copies of $H$ which cover all the vertices in $G$. The seminal Hajnal--Szemer\\'edi theorem characterises the minimum degree that ensures a graph $G$ contains a perfect $K_r$-packing. In this paper we prove the following analogue for directed graphs: Suppose that $T$ is a tournament on $r$ vertices and $G$ is a digraph of sufficiently large order $n$ where $r$ divides $n$. If $G$ has minimum in- and outdegree at least $ (1-1/r)n$ then $G$ contains a perfect $T$-packing. In the case when $T$ is a cycli"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1406.3229","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-12T13:11:38Z","cross_cats_sorted":[],"title_canon_sha256":"133fba4db89118c8fe97e761c1c2c5c63241dd5aaa4b7f61cae30fac101548b4","abstract_canon_sha256":"f63abc5308b5ad4940ddd1b90e050e031b3ace6a8aff78e10f184f36bc0f9e03"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:47.811783Z","signature_b64":"FNd+AntOIH/BLH4/2YCZv6dh1XV7oFmzX2715wv10B7/3mL7Jwj65/3egfoZkWdqxcA8hmChW50ulAYfUJXZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b0a87aa12d4d532e3b7c4c3d96245b91263ecf1e3ec04581156141c6f5bc4e0","last_reissued_at":"2026-05-18T02:28:47.811041Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:47.811041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On directed versions of the Hajnal--Szemer\\'edi theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Treglown","submitted_at":"2014-06-12T13:11:38Z","abstract_excerpt":"We say that a (di)graph $G$ has a perfect $H$-packing if there exists a set of vertex-disjoint copies of $H$ which cover all the vertices in $G$. The seminal Hajnal--Szemer\\'edi theorem characterises the minimum degree that ensures a graph $G$ contains a perfect $K_r$-packing. In this paper we prove the following analogue for directed graphs: Suppose that $T$ is a tournament on $r$ vertices and $G$ is a digraph of sufficiently large order $n$ where $r$ divides $n$. If $G$ has minimum in- and outdegree at least $ (1-1/r)n$ then $G$ contains a perfect $T$-packing. In the case when $T$ is a cycli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3229","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1406.3229","created_at":"2026-05-18T02:28:47.811163+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.3229v2","created_at":"2026-05-18T02:28:47.811163+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3229","created_at":"2026-05-18T02:28:47.811163+00:00"},{"alias_kind":"pith_short_12","alias_value":"FMFIPKQS2TKT","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FMFIPKQS2TKTFY5X","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FMFIPKQS","created_at":"2026-05-18T12:28:28.263976+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FMFIPKQS2TKTFY5XYTB5SYSFXE","json":"https://pith.science/pith/FMFIPKQS2TKTFY5XYTB5SYSFXE.json","graph_json":"https://pith.science/api/pith-number/FMFIPKQS2TKTFY5XYTB5SYSFXE/graph.json","events_json":"https://pith.science/api/pith-number/FMFIPKQS2TKTFY5XYTB5SYSFXE/events.json","paper":"https://pith.science/paper/FMFIPKQS"},"agent_actions":{"view_html":"https://pith.science/pith/FMFIPKQS2TKTFY5XYTB5SYSFXE","download_json":"https://pith.science/pith/FMFIPKQS2TKTFY5XYTB5SYSFXE.json","view_paper":"https://pith.science/paper/FMFIPKQS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.3229&json=true","fetch_graph":"https://pith.science/api/pith-number/FMFIPKQS2TKTFY5XYTB5SYSFXE/graph.json","fetch_events":"https://pith.science/api/pith-number/FMFIPKQS2TKTFY5XYTB5SYSFXE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FMFIPKQS2TKTFY5XYTB5SYSFXE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FMFIPKQS2TKTFY5XYTB5SYSFXE/action/storage_attestation","attest_author":"https://pith.science/pith/FMFIPKQS2TKTFY5XYTB5SYSFXE/action/author_attestation","sign_citation":"https://pith.science/pith/FMFIPKQS2TKTFY5XYTB5SYSFXE/action/citation_signature","submit_replication":"https://pith.science/pith/FMFIPKQS2TKTFY5XYTB5SYSFXE/action/replication_record"}},"created_at":"2026-05-18T02:28:47.811163+00:00","updated_at":"2026-05-18T02:28:47.811163+00:00"}