{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LFUWJB6434TRTSNYWPJZP4Z3GO","short_pith_number":"pith:LFUWJB64","schema_version":"1.0","canonical_sha256":"59696487dcdf2719c9b8b3d397f33b33910930f6f2a5c95d3eab318daf9367bd","source":{"kind":"arxiv","id":"1503.08371","version":4},"attestation_state":"computed","paper":{"title":"Partitioning $H$-minor free graphs into three subgraphs with no large components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chun-Hung Liu, Sang-il Oum","submitted_at":"2015-03-29T00:22:18Z","abstract_excerpt":"We prove that for every graph $H$, if a graph $G$ has no (odd) $H$ minor, then its vertex set $V(G)$ can be partitioned into three sets $X_1$, $X_2$, $X_3$ such that for each~$i$, the subgraph induced on $X_i$ has no component of size larger than a function of~$H$ and the maximum degree of~$G$. This improves a previous result of Alon, Ding, Oporowski and Vertigan~(2003) stating that $V(G)$ can be partitioned into four such sets if $G$ has no $H$ minor. Our theorem generalizes a result of Esperet and Joret~(2014), who proved it for graphs embeddable on a fixed surface and asked whether it is tr"},"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":"1503.08371","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-29T00:22:18Z","cross_cats_sorted":[],"title_canon_sha256":"32413192887366a49bec4e64962ba46a4212be68b1dabd618a7cfa4b0fd86462","abstract_canon_sha256":"ac2c86d554c187f5f6fb05d85893dec8b794853a9fae4e25010c567733fd6db2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:03.396577Z","signature_b64":"vAoXi3LC3jmdT+zxfFT8gwhnQ/no/iXSjIzf3L9Jme1dXlFMFdzm6rHXOvcl7qL5G9rz/MAHYSuYnx55QmBHDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59696487dcdf2719c9b8b3d397f33b33910930f6f2a5c95d3eab318daf9367bd","last_reissued_at":"2026-05-18T00:16:03.396203Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:03.396203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partitioning $H$-minor free graphs into three subgraphs with no large components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chun-Hung Liu, Sang-il Oum","submitted_at":"2015-03-29T00:22:18Z","abstract_excerpt":"We prove that for every graph $H$, if a graph $G$ has no (odd) $H$ minor, then its vertex set $V(G)$ can be partitioned into three sets $X_1$, $X_2$, $X_3$ such that for each~$i$, the subgraph induced on $X_i$ has no component of size larger than a function of~$H$ and the maximum degree of~$G$. This improves a previous result of Alon, Ding, Oporowski and Vertigan~(2003) stating that $V(G)$ can be partitioned into four such sets if $G$ has no $H$ minor. Our theorem generalizes a result of Esperet and Joret~(2014), who proved it for graphs embeddable on a fixed surface and asked whether it is tr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08371","kind":"arxiv","version":4},"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":"1503.08371","created_at":"2026-05-18T00:16:03.396260+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.08371v4","created_at":"2026-05-18T00:16:03.396260+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08371","created_at":"2026-05-18T00:16:03.396260+00:00"},{"alias_kind":"pith_short_12","alias_value":"LFUWJB6434TR","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LFUWJB6434TRTSNY","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LFUWJB64","created_at":"2026-05-18T12:29:29.992203+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/LFUWJB6434TRTSNYWPJZP4Z3GO","json":"https://pith.science/pith/LFUWJB6434TRTSNYWPJZP4Z3GO.json","graph_json":"https://pith.science/api/pith-number/LFUWJB6434TRTSNYWPJZP4Z3GO/graph.json","events_json":"https://pith.science/api/pith-number/LFUWJB6434TRTSNYWPJZP4Z3GO/events.json","paper":"https://pith.science/paper/LFUWJB64"},"agent_actions":{"view_html":"https://pith.science/pith/LFUWJB6434TRTSNYWPJZP4Z3GO","download_json":"https://pith.science/pith/LFUWJB6434TRTSNYWPJZP4Z3GO.json","view_paper":"https://pith.science/paper/LFUWJB64","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.08371&json=true","fetch_graph":"https://pith.science/api/pith-number/LFUWJB6434TRTSNYWPJZP4Z3GO/graph.json","fetch_events":"https://pith.science/api/pith-number/LFUWJB6434TRTSNYWPJZP4Z3GO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LFUWJB6434TRTSNYWPJZP4Z3GO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LFUWJB6434TRTSNYWPJZP4Z3GO/action/storage_attestation","attest_author":"https://pith.science/pith/LFUWJB6434TRTSNYWPJZP4Z3GO/action/author_attestation","sign_citation":"https://pith.science/pith/LFUWJB6434TRTSNYWPJZP4Z3GO/action/citation_signature","submit_replication":"https://pith.science/pith/LFUWJB6434TRTSNYWPJZP4Z3GO/action/replication_record"}},"created_at":"2026-05-18T00:16:03.396260+00:00","updated_at":"2026-05-18T00:16:03.396260+00:00"}