{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:EKY5ANCAP6FU5N2MPET5KFTVV4","short_pith_number":"pith:EKY5ANCA","schema_version":"1.0","canonical_sha256":"22b1d034407f8b4eb74c7927d51675af07fe0a50fca2b7fbb20d843c90be98b4","source":{"kind":"arxiv","id":"1307.4803","version":1},"attestation_state":"computed","paper":{"title":"An extension of the Hajnal-Szemeredi theorem to directed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej Czygrinow, H.A. Kierstead, Louis DeBiasio, Theodore Molla","submitted_at":"2013-07-17T22:46:10Z","abstract_excerpt":"Hajnal and Szemeredi proved that every graph G with |G|=ks and minimum degree at least k(s-1) contains k vertex disjoint s-cliques; moreover this degree bound is optimal. We extend their theorem to directed graphs by showing that every directed graph D with |D|=ks and minimum (total) degree at least 2k(s-1)-1 contains k vertex disjoint transitive tournaments on s vertices. Our result implies the Hajnal-Szemeredi Theorem, and the degree bound is optimal. We also make some conjectures regarding even more general results for multigraphs and partitioning into other tournaments. One of these conjec"},"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":"1307.4803","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-17T22:46:10Z","cross_cats_sorted":[],"title_canon_sha256":"9ba34b5ceb278eb7fd497beb567aec8b7062a0ccfa88180233bad906e6734f9d","abstract_canon_sha256":"dfea46986b442657862b5b1225f87c3489986dec5a97538ca9750ec1b8a0666d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:08.634652Z","signature_b64":"jF/wxFVeX3ZtsDTzL7G5GcmC1TneTlztnOtV8QmdLVoBr5gBOKYG1GzCBctplOo4/F7azxpbz2jwnWpdX8ZiBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22b1d034407f8b4eb74c7927d51675af07fe0a50fca2b7fbb20d843c90be98b4","last_reissued_at":"2026-05-18T03:18:08.633988Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:08.633988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An extension of the Hajnal-Szemeredi theorem to directed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej Czygrinow, H.A. Kierstead, Louis DeBiasio, Theodore Molla","submitted_at":"2013-07-17T22:46:10Z","abstract_excerpt":"Hajnal and Szemeredi proved that every graph G with |G|=ks and minimum degree at least k(s-1) contains k vertex disjoint s-cliques; moreover this degree bound is optimal. We extend their theorem to directed graphs by showing that every directed graph D with |D|=ks and minimum (total) degree at least 2k(s-1)-1 contains k vertex disjoint transitive tournaments on s vertices. Our result implies the Hajnal-Szemeredi Theorem, and the degree bound is optimal. We also make some conjectures regarding even more general results for multigraphs and partitioning into other tournaments. One of these conjec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4803","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1307.4803","created_at":"2026-05-18T03:18:08.634090+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.4803v1","created_at":"2026-05-18T03:18:08.634090+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4803","created_at":"2026-05-18T03:18:08.634090+00:00"},{"alias_kind":"pith_short_12","alias_value":"EKY5ANCAP6FU","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"EKY5ANCAP6FU5N2M","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"EKY5ANCA","created_at":"2026-05-18T12:27:43.054852+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/EKY5ANCAP6FU5N2MPET5KFTVV4","json":"https://pith.science/pith/EKY5ANCAP6FU5N2MPET5KFTVV4.json","graph_json":"https://pith.science/api/pith-number/EKY5ANCAP6FU5N2MPET5KFTVV4/graph.json","events_json":"https://pith.science/api/pith-number/EKY5ANCAP6FU5N2MPET5KFTVV4/events.json","paper":"https://pith.science/paper/EKY5ANCA"},"agent_actions":{"view_html":"https://pith.science/pith/EKY5ANCAP6FU5N2MPET5KFTVV4","download_json":"https://pith.science/pith/EKY5ANCAP6FU5N2MPET5KFTVV4.json","view_paper":"https://pith.science/paper/EKY5ANCA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.4803&json=true","fetch_graph":"https://pith.science/api/pith-number/EKY5ANCAP6FU5N2MPET5KFTVV4/graph.json","fetch_events":"https://pith.science/api/pith-number/EKY5ANCAP6FU5N2MPET5KFTVV4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EKY5ANCAP6FU5N2MPET5KFTVV4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EKY5ANCAP6FU5N2MPET5KFTVV4/action/storage_attestation","attest_author":"https://pith.science/pith/EKY5ANCAP6FU5N2MPET5KFTVV4/action/author_attestation","sign_citation":"https://pith.science/pith/EKY5ANCAP6FU5N2MPET5KFTVV4/action/citation_signature","submit_replication":"https://pith.science/pith/EKY5ANCAP6FU5N2MPET5KFTVV4/action/replication_record"}},"created_at":"2026-05-18T03:18:08.634090+00:00","updated_at":"2026-05-18T03:18:08.634090+00:00"}