{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:QRIRXEEGTSAS4MKZ2M5H3GLBYB","short_pith_number":"pith:QRIRXEEG","schema_version":"1.0","canonical_sha256":"84511b90869c812e3159d33a7d9961c04fb2eef815f15d6a7c76e92cd86a5f23","source":{"kind":"arxiv","id":"1212.3036","version":1},"attestation_state":"computed","paper":{"title":"Claw-free graphs, skeletal graphs, and a stronger conjecture on $\\omega$, $\\Delta$, and $\\chi$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Andrew D. King, Bruce A. Reed","submitted_at":"2012-12-13T01:58:37Z","abstract_excerpt":"The second author's $\\omega$, $\\Delta$, $\\chi$ conjecture proposes that every graph satisties $\\chi \\leq \\lceil \\frac 12 (\\Delta+1+\\omega)\\rceil$. In this paper we prove that the conjecture holds for all claw-free graphs. Our approach uses the structure theorem of Chudnovsky and Seymour.\n  Along the way we discuss a stronger local conjecture, and prove that it holds for claw-free graphs with a three-colourable complement. To prove our results we introduce a very useful $\\chi$-preserving reduction on homogeneous pairs of cliques, and thus restrict our view to so-called \"skeletal\" graphs."},"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":"1212.3036","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-12-13T01:58:37Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d8406d19005e230821fe84f4d95aaef4c26498bfe20e565548a731d97d825fe1","abstract_canon_sha256":"be6333ba61bc524499f368b9a5784a87273f2d0e2a575dbece77178f50ca0757"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:33.882231Z","signature_b64":"BcDccJ8ZJST1T5khtke7bnkHGaorphaQXrK7lRI64rIU+WZaA2uET3cPT3PFBZaLbX2toa4pKdmu4ZU9TQqrCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84511b90869c812e3159d33a7d9961c04fb2eef815f15d6a7c76e92cd86a5f23","last_reissued_at":"2026-05-18T03:38:33.881733Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:33.881733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Claw-free graphs, skeletal graphs, and a stronger conjecture on $\\omega$, $\\Delta$, and $\\chi$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Andrew D. King, Bruce A. Reed","submitted_at":"2012-12-13T01:58:37Z","abstract_excerpt":"The second author's $\\omega$, $\\Delta$, $\\chi$ conjecture proposes that every graph satisties $\\chi \\leq \\lceil \\frac 12 (\\Delta+1+\\omega)\\rceil$. In this paper we prove that the conjecture holds for all claw-free graphs. Our approach uses the structure theorem of Chudnovsky and Seymour.\n  Along the way we discuss a stronger local conjecture, and prove that it holds for claw-free graphs with a three-colourable complement. To prove our results we introduce a very useful $\\chi$-preserving reduction on homogeneous pairs of cliques, and thus restrict our view to so-called \"skeletal\" graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3036","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":"1212.3036","created_at":"2026-05-18T03:38:33.881810+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.3036v1","created_at":"2026-05-18T03:38:33.881810+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3036","created_at":"2026-05-18T03:38:33.881810+00:00"},{"alias_kind":"pith_short_12","alias_value":"QRIRXEEGTSAS","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"QRIRXEEGTSAS4MKZ","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"QRIRXEEG","created_at":"2026-05-18T12:27:18.751474+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/QRIRXEEGTSAS4MKZ2M5H3GLBYB","json":"https://pith.science/pith/QRIRXEEGTSAS4MKZ2M5H3GLBYB.json","graph_json":"https://pith.science/api/pith-number/QRIRXEEGTSAS4MKZ2M5H3GLBYB/graph.json","events_json":"https://pith.science/api/pith-number/QRIRXEEGTSAS4MKZ2M5H3GLBYB/events.json","paper":"https://pith.science/paper/QRIRXEEG"},"agent_actions":{"view_html":"https://pith.science/pith/QRIRXEEGTSAS4MKZ2M5H3GLBYB","download_json":"https://pith.science/pith/QRIRXEEGTSAS4MKZ2M5H3GLBYB.json","view_paper":"https://pith.science/paper/QRIRXEEG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.3036&json=true","fetch_graph":"https://pith.science/api/pith-number/QRIRXEEGTSAS4MKZ2M5H3GLBYB/graph.json","fetch_events":"https://pith.science/api/pith-number/QRIRXEEGTSAS4MKZ2M5H3GLBYB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QRIRXEEGTSAS4MKZ2M5H3GLBYB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QRIRXEEGTSAS4MKZ2M5H3GLBYB/action/storage_attestation","attest_author":"https://pith.science/pith/QRIRXEEGTSAS4MKZ2M5H3GLBYB/action/author_attestation","sign_citation":"https://pith.science/pith/QRIRXEEGTSAS4MKZ2M5H3GLBYB/action/citation_signature","submit_replication":"https://pith.science/pith/QRIRXEEGTSAS4MKZ2M5H3GLBYB/action/replication_record"}},"created_at":"2026-05-18T03:38:33.881810+00:00","updated_at":"2026-05-18T03:38:33.881810+00:00"}