{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6FFB45JQNWD475KQHXNX7UIODL","short_pith_number":"pith:6FFB45JQ","schema_version":"1.0","canonical_sha256":"f14a1e75306d87cff5503ddb7fd10e1ad21617ce2431843e583e96e4c1822b30","source":{"kind":"arxiv","id":"1803.03704","version":1},"attestation_state":"computed","paper":{"title":"Edge-decomposing graphs into coprime forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"St\\'ephan Thomass\\'e, Tereza Klimo\\v{s}ov\\'a","submitted_at":"2018-03-09T21:49:50Z","abstract_excerpt":"The Barat-Thomassen conjecture, recently proved in [Bensmail et al.: A proof of the Barat-Thomassen conjecture. J. Combin. Theory Ser. B, 124:39-55, 2017.], asserts that for every tree T, there is a constant $c_T$ such that every $c_T$-edge connected graph G with number of edges (size) divisible by the size of T admits an edge partition into copies of T (a T-decomposition). In this paper, we investigate in which case the connectivity requirement can be dropped to a minimum degree condition. For instance, it was shown in [Bensmail et al.: Edge-partitioning a graph into paths: beyond the Barat-T"},"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":"1803.03704","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-09T21:49:50Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"4fd31995f07d5a0a0172cffd2674c936b19bb4af164e6284bde48f0ebd7de7f0","abstract_canon_sha256":"4975b421e4d3b4bcc7dff4158cbad897ae109b7e12a23ed12b5bb736079512aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:38.416181Z","signature_b64":"lo+52DdCqodO4UHAppKf5DD/c6Rm+d7xE/eXjEDmLdHBBZWoRtyVhgNU2xxovHfuzPR1OHnSeMSyetg8LFD7Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f14a1e75306d87cff5503ddb7fd10e1ad21617ce2431843e583e96e4c1822b30","last_reissued_at":"2026-05-18T00:21:38.415630Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:38.415630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Edge-decomposing graphs into coprime forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"St\\'ephan Thomass\\'e, Tereza Klimo\\v{s}ov\\'a","submitted_at":"2018-03-09T21:49:50Z","abstract_excerpt":"The Barat-Thomassen conjecture, recently proved in [Bensmail et al.: A proof of the Barat-Thomassen conjecture. J. Combin. Theory Ser. B, 124:39-55, 2017.], asserts that for every tree T, there is a constant $c_T$ such that every $c_T$-edge connected graph G with number of edges (size) divisible by the size of T admits an edge partition into copies of T (a T-decomposition). In this paper, we investigate in which case the connectivity requirement can be dropped to a minimum degree condition. For instance, it was shown in [Bensmail et al.: Edge-partitioning a graph into paths: beyond the Barat-T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03704","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":"1803.03704","created_at":"2026-05-18T00:21:38.415703+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.03704v1","created_at":"2026-05-18T00:21:38.415703+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03704","created_at":"2026-05-18T00:21:38.415703+00:00"},{"alias_kind":"pith_short_12","alias_value":"6FFB45JQNWD4","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"6FFB45JQNWD475KQ","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"6FFB45JQ","created_at":"2026-05-18T12:32:08.215937+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.11600","citing_title":"Edge-partitioning 3-edge-connected graphs into paths","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6FFB45JQNWD475KQHXNX7UIODL","json":"https://pith.science/pith/6FFB45JQNWD475KQHXNX7UIODL.json","graph_json":"https://pith.science/api/pith-number/6FFB45JQNWD475KQHXNX7UIODL/graph.json","events_json":"https://pith.science/api/pith-number/6FFB45JQNWD475KQHXNX7UIODL/events.json","paper":"https://pith.science/paper/6FFB45JQ"},"agent_actions":{"view_html":"https://pith.science/pith/6FFB45JQNWD475KQHXNX7UIODL","download_json":"https://pith.science/pith/6FFB45JQNWD475KQHXNX7UIODL.json","view_paper":"https://pith.science/paper/6FFB45JQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.03704&json=true","fetch_graph":"https://pith.science/api/pith-number/6FFB45JQNWD475KQHXNX7UIODL/graph.json","fetch_events":"https://pith.science/api/pith-number/6FFB45JQNWD475KQHXNX7UIODL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6FFB45JQNWD475KQHXNX7UIODL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6FFB45JQNWD475KQHXNX7UIODL/action/storage_attestation","attest_author":"https://pith.science/pith/6FFB45JQNWD475KQHXNX7UIODL/action/author_attestation","sign_citation":"https://pith.science/pith/6FFB45JQNWD475KQHXNX7UIODL/action/citation_signature","submit_replication":"https://pith.science/pith/6FFB45JQNWD475KQHXNX7UIODL/action/replication_record"}},"created_at":"2026-05-18T00:21:38.415703+00:00","updated_at":"2026-05-18T00:21:38.415703+00:00"}