{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QEORV2KYNDFD424MRIPNS5VTG3","short_pith_number":"pith:QEORV2KY","schema_version":"1.0","canonical_sha256":"811d1ae95868ca3e6b8c8a1ed976b336d8d75dcafa4d5506135933bd265bb3a6","source":{"kind":"arxiv","id":"1806.05347","version":1},"attestation_state":"computed","paper":{"title":"Cut-edges and regular factors in regular graphs of odd degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander V. Kostochka, Andr\\'e Raspaud, Bjarne Toft, Dara Zirlin, Douglas B. West","submitted_at":"2018-06-14T03:09:59Z","abstract_excerpt":"We study $2k$-factors in $(2r+1)$-regular graphs. Hanson, Loten, and Toft proved that every $(2r+1)$-regular graph with at most $2r$ cut-edges has a $2$-factor. We generalize their result by proving for $k\\le(2r+1)/3$ that every $(2r+1)$-regular graph with at most $2r-3(k-1)$ cut-edges has a $2k$-factor. Both the restriction on $k$ and the restriction on the number of cut-edges are sharp. We characterize the graphs that have exactly $2r-3(k-1)+1$ cut-edges but no $2k$-factor. For $k>(2r+1)/3$, there are graphs without cut-edges that have no $2k$-factor, as studied by Bollob\\'as, Saito, and Wor"},"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":"1806.05347","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-14T03:09:59Z","cross_cats_sorted":[],"title_canon_sha256":"7ce994ad56b70de4bcd3f7991df811e1b203f16260209f35fd589eba2cba869f","abstract_canon_sha256":"3bcf3e11f787aad44b88a2611e1adcf676f8c73b088e386044c79d43ae5d45a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:16.282656Z","signature_b64":"GYOaWjfoym0ELnrtbYiiU9YaYvYTRjbQGkzZlfeRvIQHUf/0cdbv0zPUcqrMRbPw6FnFU3SmsV49auVghnRCAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"811d1ae95868ca3e6b8c8a1ed976b336d8d75dcafa4d5506135933bd265bb3a6","last_reissued_at":"2026-05-18T00:13:16.282052Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:16.282052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cut-edges and regular factors in regular graphs of odd degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander V. Kostochka, Andr\\'e Raspaud, Bjarne Toft, Dara Zirlin, Douglas B. West","submitted_at":"2018-06-14T03:09:59Z","abstract_excerpt":"We study $2k$-factors in $(2r+1)$-regular graphs. Hanson, Loten, and Toft proved that every $(2r+1)$-regular graph with at most $2r$ cut-edges has a $2$-factor. We generalize their result by proving for $k\\le(2r+1)/3$ that every $(2r+1)$-regular graph with at most $2r-3(k-1)$ cut-edges has a $2k$-factor. Both the restriction on $k$ and the restriction on the number of cut-edges are sharp. We characterize the graphs that have exactly $2r-3(k-1)+1$ cut-edges but no $2k$-factor. For $k>(2r+1)/3$, there are graphs without cut-edges that have no $2k$-factor, as studied by Bollob\\'as, Saito, and Wor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.05347","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":"1806.05347","created_at":"2026-05-18T00:13:16.282133+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.05347v1","created_at":"2026-05-18T00:13:16.282133+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.05347","created_at":"2026-05-18T00:13:16.282133+00:00"},{"alias_kind":"pith_short_12","alias_value":"QEORV2KYNDFD","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"QEORV2KYNDFD424M","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"QEORV2KY","created_at":"2026-05-18T12:32:46.962924+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/QEORV2KYNDFD424MRIPNS5VTG3","json":"https://pith.science/pith/QEORV2KYNDFD424MRIPNS5VTG3.json","graph_json":"https://pith.science/api/pith-number/QEORV2KYNDFD424MRIPNS5VTG3/graph.json","events_json":"https://pith.science/api/pith-number/QEORV2KYNDFD424MRIPNS5VTG3/events.json","paper":"https://pith.science/paper/QEORV2KY"},"agent_actions":{"view_html":"https://pith.science/pith/QEORV2KYNDFD424MRIPNS5VTG3","download_json":"https://pith.science/pith/QEORV2KYNDFD424MRIPNS5VTG3.json","view_paper":"https://pith.science/paper/QEORV2KY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.05347&json=true","fetch_graph":"https://pith.science/api/pith-number/QEORV2KYNDFD424MRIPNS5VTG3/graph.json","fetch_events":"https://pith.science/api/pith-number/QEORV2KYNDFD424MRIPNS5VTG3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QEORV2KYNDFD424MRIPNS5VTG3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QEORV2KYNDFD424MRIPNS5VTG3/action/storage_attestation","attest_author":"https://pith.science/pith/QEORV2KYNDFD424MRIPNS5VTG3/action/author_attestation","sign_citation":"https://pith.science/pith/QEORV2KYNDFD424MRIPNS5VTG3/action/citation_signature","submit_replication":"https://pith.science/pith/QEORV2KYNDFD424MRIPNS5VTG3/action/replication_record"}},"created_at":"2026-05-18T00:13:16.282133+00:00","updated_at":"2026-05-18T00:13:16.282133+00:00"}