{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IA6ZL5DEZTNOSA2UNYI7E73WWO","short_pith_number":"pith:IA6ZL5DE","schema_version":"1.0","canonical_sha256":"403d95f464ccdae903546e11f27f76b398a63bb0323af85e95c080a2ac0fff42","source":{"kind":"arxiv","id":"1510.06667","version":2},"attestation_state":"computed","paper":{"title":"Disjoint cycles of different lengths in graphs and digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ararat Harutyunyan, Binlong Li, Julien Bensmail, Ngoc Khang Le, Nicolas Lichiardopol","submitted_at":"2015-10-22T15:58:51Z","abstract_excerpt":"Understanding how the cycles of a graph or digraph behave in general has always been an important point of graph theory. In this paper, we study the question of finding a set of $k$ vertex-disjoint cycles (resp. directed cycles) of distinct lengths in a given graph (resp. digraph). In the context of undirected graphs, we prove that, for every $k \\geq 1$, every graph with minimum degree at least $\\frac{k^2+5k-2}{2}$ has $k$ vertex-disjoint cycles of different lengths, where the degree bound is best possible. We also consider stronger situations, and exhibit degree bounds (some of which are best"},"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":"1510.06667","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-22T15:58:51Z","cross_cats_sorted":[],"title_canon_sha256":"74e2f04a8fb85eaf30956660dc783022cd7ea7af8bbfc6ec896be05baf2bf45a","abstract_canon_sha256":"e959bdc01e15f474568312d4e78fc5b2a6b06f6c802a10dc96413a71608887e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:11.886381Z","signature_b64":"yyDreiRuKiDjMm5DLSntJRuDPd66spC07eNBSElSLu3BgDhS/mhJrukTmaSyBEyhGGqzevXYwxGQen2TewvvAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"403d95f464ccdae903546e11f27f76b398a63bb0323af85e95c080a2ac0fff42","last_reissued_at":"2026-05-18T01:23:11.885809Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:11.885809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Disjoint cycles of different lengths in graphs and digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ararat Harutyunyan, Binlong Li, Julien Bensmail, Ngoc Khang Le, Nicolas Lichiardopol","submitted_at":"2015-10-22T15:58:51Z","abstract_excerpt":"Understanding how the cycles of a graph or digraph behave in general has always been an important point of graph theory. In this paper, we study the question of finding a set of $k$ vertex-disjoint cycles (resp. directed cycles) of distinct lengths in a given graph (resp. digraph). In the context of undirected graphs, we prove that, for every $k \\geq 1$, every graph with minimum degree at least $\\frac{k^2+5k-2}{2}$ has $k$ vertex-disjoint cycles of different lengths, where the degree bound is best possible. We also consider stronger situations, and exhibit degree bounds (some of which are best"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06667","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":"1510.06667","created_at":"2026-05-18T01:23:11.885892+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.06667v2","created_at":"2026-05-18T01:23:11.885892+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06667","created_at":"2026-05-18T01:23:11.885892+00:00"},{"alias_kind":"pith_short_12","alias_value":"IA6ZL5DEZTNO","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IA6ZL5DEZTNOSA2U","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IA6ZL5DE","created_at":"2026-05-18T12:29:25.134429+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/IA6ZL5DEZTNOSA2UNYI7E73WWO","json":"https://pith.science/pith/IA6ZL5DEZTNOSA2UNYI7E73WWO.json","graph_json":"https://pith.science/api/pith-number/IA6ZL5DEZTNOSA2UNYI7E73WWO/graph.json","events_json":"https://pith.science/api/pith-number/IA6ZL5DEZTNOSA2UNYI7E73WWO/events.json","paper":"https://pith.science/paper/IA6ZL5DE"},"agent_actions":{"view_html":"https://pith.science/pith/IA6ZL5DEZTNOSA2UNYI7E73WWO","download_json":"https://pith.science/pith/IA6ZL5DEZTNOSA2UNYI7E73WWO.json","view_paper":"https://pith.science/paper/IA6ZL5DE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.06667&json=true","fetch_graph":"https://pith.science/api/pith-number/IA6ZL5DEZTNOSA2UNYI7E73WWO/graph.json","fetch_events":"https://pith.science/api/pith-number/IA6ZL5DEZTNOSA2UNYI7E73WWO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IA6ZL5DEZTNOSA2UNYI7E73WWO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IA6ZL5DEZTNOSA2UNYI7E73WWO/action/storage_attestation","attest_author":"https://pith.science/pith/IA6ZL5DEZTNOSA2UNYI7E73WWO/action/author_attestation","sign_citation":"https://pith.science/pith/IA6ZL5DEZTNOSA2UNYI7E73WWO/action/citation_signature","submit_replication":"https://pith.science/pith/IA6ZL5DEZTNOSA2UNYI7E73WWO/action/replication_record"}},"created_at":"2026-05-18T01:23:11.885892+00:00","updated_at":"2026-05-18T01:23:11.885892+00:00"}