{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Z4A4JW5H4W352KRL2GXWBOYENF","short_pith_number":"pith:Z4A4JW5H","schema_version":"1.0","canonical_sha256":"cf01c4dba7e5b7dd2a2bd1af60bb0469645420fc9f0a08452bf4633a888d5d90","source":{"kind":"arxiv","id":"1705.08592","version":1},"attestation_state":"computed","paper":{"title":"Sufficient conditions for the existence of a path-factor which are related to odd components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kenta Ozeki, Michitaka Furuya, Yoshimi Egawa","submitted_at":"2017-05-24T03:24:06Z","abstract_excerpt":"In this paper, we are concerned with sufficient conditions for the existence of a $\\{P_{2},P_{2k+1}\\}$-factor. We prove that for $k\\geq 3$, there exists $\\varepsilon_{k}>0$ such that if a graph $G$ satisfies $\\sum_{0\\leq j\\leq k-1}c_{2j+1}(G-X)\\leq \\varepsilon_{k}|X|$ for all $X\\subseteq V(G)$, then $G$ has a $\\{P_{2},P_{2k+1}\\}$-factor, where $c_{i}(G-X)$ is the number of components $C$ of $G-X$ with $|V(C)|=i$. On the other hand, we construct infinitely many graphs $G$ having no $\\{P_{2},P_{2k+1}\\}$-factor such that $\\sum_{0\\leq j\\leq k-1}c_{2j+1}(G-X)\\leq \\frac{32k+141}{72k-78}|X|$ for all "},"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":"1705.08592","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-24T03:24:06Z","cross_cats_sorted":[],"title_canon_sha256":"d579798385363d40cff62605b39aaac3a529e3fbaab2bec2cc591080bd8888ec","abstract_canon_sha256":"dc72d6e4d6dd5cf66a1b8ef26bc447ac9bb6256c16667aa407b8fb7123bee194"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:45.658630Z","signature_b64":"PBztBrDBFrlN70LEUibsPGVxzVaD2WMsT0Ehaz9/EiXT30aTIh02X9OUFOk3n6dI3os2YL4ae7AIRmN5IsBUDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf01c4dba7e5b7dd2a2bd1af60bb0469645420fc9f0a08452bf4633a888d5d90","last_reissued_at":"2026-05-18T00:43:45.658199Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:45.658199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sufficient conditions for the existence of a path-factor which are related to odd components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kenta Ozeki, Michitaka Furuya, Yoshimi Egawa","submitted_at":"2017-05-24T03:24:06Z","abstract_excerpt":"In this paper, we are concerned with sufficient conditions for the existence of a $\\{P_{2},P_{2k+1}\\}$-factor. We prove that for $k\\geq 3$, there exists $\\varepsilon_{k}>0$ such that if a graph $G$ satisfies $\\sum_{0\\leq j\\leq k-1}c_{2j+1}(G-X)\\leq \\varepsilon_{k}|X|$ for all $X\\subseteq V(G)$, then $G$ has a $\\{P_{2},P_{2k+1}\\}$-factor, where $c_{i}(G-X)$ is the number of components $C$ of $G-X$ with $|V(C)|=i$. On the other hand, we construct infinitely many graphs $G$ having no $\\{P_{2},P_{2k+1}\\}$-factor such that $\\sum_{0\\leq j\\leq k-1}c_{2j+1}(G-X)\\leq \\frac{32k+141}{72k-78}|X|$ for all "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08592","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":"1705.08592","created_at":"2026-05-18T00:43:45.658272+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.08592v1","created_at":"2026-05-18T00:43:45.658272+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08592","created_at":"2026-05-18T00:43:45.658272+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z4A4JW5H4W35","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z4A4JW5H4W352KRL","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z4A4JW5H","created_at":"2026-05-18T12:31:59.375834+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/Z4A4JW5H4W352KRL2GXWBOYENF","json":"https://pith.science/pith/Z4A4JW5H4W352KRL2GXWBOYENF.json","graph_json":"https://pith.science/api/pith-number/Z4A4JW5H4W352KRL2GXWBOYENF/graph.json","events_json":"https://pith.science/api/pith-number/Z4A4JW5H4W352KRL2GXWBOYENF/events.json","paper":"https://pith.science/paper/Z4A4JW5H"},"agent_actions":{"view_html":"https://pith.science/pith/Z4A4JW5H4W352KRL2GXWBOYENF","download_json":"https://pith.science/pith/Z4A4JW5H4W352KRL2GXWBOYENF.json","view_paper":"https://pith.science/paper/Z4A4JW5H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.08592&json=true","fetch_graph":"https://pith.science/api/pith-number/Z4A4JW5H4W352KRL2GXWBOYENF/graph.json","fetch_events":"https://pith.science/api/pith-number/Z4A4JW5H4W352KRL2GXWBOYENF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z4A4JW5H4W352KRL2GXWBOYENF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z4A4JW5H4W352KRL2GXWBOYENF/action/storage_attestation","attest_author":"https://pith.science/pith/Z4A4JW5H4W352KRL2GXWBOYENF/action/author_attestation","sign_citation":"https://pith.science/pith/Z4A4JW5H4W352KRL2GXWBOYENF/action/citation_signature","submit_replication":"https://pith.science/pith/Z4A4JW5H4W352KRL2GXWBOYENF/action/replication_record"}},"created_at":"2026-05-18T00:43:45.658272+00:00","updated_at":"2026-05-18T00:43:45.658272+00:00"}