{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DX6ZXVDV6H7ZCTU4Z3FWPGYD4F","short_pith_number":"pith:DX6ZXVDV","schema_version":"1.0","canonical_sha256":"1dfd9bd475f1ff914e9ccecb679b03e15ce7d9fe6c1529ca98af170e6c95f661","source":{"kind":"arxiv","id":"1611.09060","version":3},"attestation_state":"computed","paper":{"title":"Defective colouring of graphs excluding a subgraph or minor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David R. Wood, Patrice Ossona de Mendez, Sang-il Oum","submitted_at":"2016-11-28T10:52:39Z","abstract_excerpt":"Archdeacon (1987) proved that graphs embeddable on a fixed surface can be $3$-coloured so that each colour class induces a subgraph of bounded maximum degree. Edwards, Kang, Kim, Oum and Seymour (2015) proved that graphs with no $K_{t+1}$-minor can be $t$-coloured so that each colour class induces a subgraph of bounded maximum degree. We prove a common generalisation of these theorems with a weaker assumption about excluded subgraphs. This result leads to new defective colouring results for several graph classes, including graphs with linear crossing number, graphs with given thickness (with r"},"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":"1611.09060","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-28T10:52:39Z","cross_cats_sorted":[],"title_canon_sha256":"2b77c25f982a48d1958571c1ec68823f503fd837860771c81735bd3a24b1f584","abstract_canon_sha256":"77eed9e6139ad123f08d6d497aeae870ad4db484d169b734f4e8953fd300345a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:50.020425Z","signature_b64":"UVbpIapBzQ1NFTM6XsSPw96Spr6l3wmgn0oafCmRbE55JvKKxJAjqirDV39XxFRHgeQE24eB1zHmu6b9m8NXDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1dfd9bd475f1ff914e9ccecb679b03e15ce7d9fe6c1529ca98af170e6c95f661","last_reissued_at":"2026-05-17T23:40:50.019694Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:50.019694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Defective colouring of graphs excluding a subgraph or minor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David R. Wood, Patrice Ossona de Mendez, Sang-il Oum","submitted_at":"2016-11-28T10:52:39Z","abstract_excerpt":"Archdeacon (1987) proved that graphs embeddable on a fixed surface can be $3$-coloured so that each colour class induces a subgraph of bounded maximum degree. Edwards, Kang, Kim, Oum and Seymour (2015) proved that graphs with no $K_{t+1}$-minor can be $t$-coloured so that each colour class induces a subgraph of bounded maximum degree. We prove a common generalisation of these theorems with a weaker assumption about excluded subgraphs. This result leads to new defective colouring results for several graph classes, including graphs with linear crossing number, graphs with given thickness (with r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09060","kind":"arxiv","version":3},"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":"1611.09060","created_at":"2026-05-17T23:40:50.019822+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.09060v3","created_at":"2026-05-17T23:40:50.019822+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09060","created_at":"2026-05-17T23:40:50.019822+00:00"},{"alias_kind":"pith_short_12","alias_value":"DX6ZXVDV6H7Z","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DX6ZXVDV6H7ZCTU4","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DX6ZXVDV","created_at":"2026-05-18T12:30:12.583610+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/DX6ZXVDV6H7ZCTU4Z3FWPGYD4F","json":"https://pith.science/pith/DX6ZXVDV6H7ZCTU4Z3FWPGYD4F.json","graph_json":"https://pith.science/api/pith-number/DX6ZXVDV6H7ZCTU4Z3FWPGYD4F/graph.json","events_json":"https://pith.science/api/pith-number/DX6ZXVDV6H7ZCTU4Z3FWPGYD4F/events.json","paper":"https://pith.science/paper/DX6ZXVDV"},"agent_actions":{"view_html":"https://pith.science/pith/DX6ZXVDV6H7ZCTU4Z3FWPGYD4F","download_json":"https://pith.science/pith/DX6ZXVDV6H7ZCTU4Z3FWPGYD4F.json","view_paper":"https://pith.science/paper/DX6ZXVDV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.09060&json=true","fetch_graph":"https://pith.science/api/pith-number/DX6ZXVDV6H7ZCTU4Z3FWPGYD4F/graph.json","fetch_events":"https://pith.science/api/pith-number/DX6ZXVDV6H7ZCTU4Z3FWPGYD4F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DX6ZXVDV6H7ZCTU4Z3FWPGYD4F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DX6ZXVDV6H7ZCTU4Z3FWPGYD4F/action/storage_attestation","attest_author":"https://pith.science/pith/DX6ZXVDV6H7ZCTU4Z3FWPGYD4F/action/author_attestation","sign_citation":"https://pith.science/pith/DX6ZXVDV6H7ZCTU4Z3FWPGYD4F/action/citation_signature","submit_replication":"https://pith.science/pith/DX6ZXVDV6H7ZCTU4Z3FWPGYD4F/action/replication_record"}},"created_at":"2026-05-17T23:40:50.019822+00:00","updated_at":"2026-05-17T23:40:50.019822+00:00"}