{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:G7KO3FFB72YDKPDKLRBDMPYK7I","short_pith_number":"pith:G7KO3FFB","schema_version":"1.0","canonical_sha256":"37d4ed94a1feb0353c6a5c42363f0afa09a971a7e404009559800dc9d6c43c58","source":{"kind":"arxiv","id":"1209.3646","version":3},"attestation_state":"computed","paper":{"title":"Coloring graphs with dense neighborhoods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Landon Rabern","submitted_at":"2012-09-17T13:25:36Z","abstract_excerpt":"It is shown that any graph with maximum degree $\\Delta$ in which the average degree of the induced subgraph on the set of all neighbors of any vertex exceeds $\\frac{6k^2}{6k^2 + 1}\\Delta + k + 6$ is either $(\\Delta - k)$-colorable or contains a clique on more than $\\Delta - 2k$ vertices. In the $k=1$ case we improve the bound on the average degree to $\\frac23\\Delta + 4$ and the bound on the clique number to $\\Delta-1$. As corollaries, we show that every graph satisfies $\\chi \\leq \\max\\set{\\omega, \\Delta - 1, 4\\alpha}$ and every graph satisfies $\\chi \\leq \\max\\set{\\omega, \\Delta - 1, \\ceil{\\fra"},"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":"1209.3646","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-17T13:25:36Z","cross_cats_sorted":[],"title_canon_sha256":"a85a920e4cde7ee7a5898d6051aa015b717981206d6a4fac1223fa7d22822f4a","abstract_canon_sha256":"5a246ca5923fe220fcc61b403f2ad0ce201c698b55c46a52b9c2198d7ea4865b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:23.619495Z","signature_b64":"nraevcwYjxLgv9Y/oE4Q6qrGavEhvyyfashPqYfHO2SWANjMo5opTukkdfXV2zQ3890tNZcrBkDg6mP54011Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37d4ed94a1feb0353c6a5c42363f0afa09a971a7e404009559800dc9d6c43c58","last_reissued_at":"2026-05-18T03:44:23.618979Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:23.618979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coloring graphs with dense neighborhoods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Landon Rabern","submitted_at":"2012-09-17T13:25:36Z","abstract_excerpt":"It is shown that any graph with maximum degree $\\Delta$ in which the average degree of the induced subgraph on the set of all neighbors of any vertex exceeds $\\frac{6k^2}{6k^2 + 1}\\Delta + k + 6$ is either $(\\Delta - k)$-colorable or contains a clique on more than $\\Delta - 2k$ vertices. In the $k=1$ case we improve the bound on the average degree to $\\frac23\\Delta + 4$ and the bound on the clique number to $\\Delta-1$. As corollaries, we show that every graph satisfies $\\chi \\leq \\max\\set{\\omega, \\Delta - 1, 4\\alpha}$ and every graph satisfies $\\chi \\leq \\max\\set{\\omega, \\Delta - 1, \\ceil{\\fra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.3646","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":"1209.3646","created_at":"2026-05-18T03:44:23.619056+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.3646v3","created_at":"2026-05-18T03:44:23.619056+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.3646","created_at":"2026-05-18T03:44:23.619056+00:00"},{"alias_kind":"pith_short_12","alias_value":"G7KO3FFB72YD","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"G7KO3FFB72YDKPDK","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"G7KO3FFB","created_at":"2026-05-18T12:27:06.952714+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/G7KO3FFB72YDKPDKLRBDMPYK7I","json":"https://pith.science/pith/G7KO3FFB72YDKPDKLRBDMPYK7I.json","graph_json":"https://pith.science/api/pith-number/G7KO3FFB72YDKPDKLRBDMPYK7I/graph.json","events_json":"https://pith.science/api/pith-number/G7KO3FFB72YDKPDKLRBDMPYK7I/events.json","paper":"https://pith.science/paper/G7KO3FFB"},"agent_actions":{"view_html":"https://pith.science/pith/G7KO3FFB72YDKPDKLRBDMPYK7I","download_json":"https://pith.science/pith/G7KO3FFB72YDKPDKLRBDMPYK7I.json","view_paper":"https://pith.science/paper/G7KO3FFB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.3646&json=true","fetch_graph":"https://pith.science/api/pith-number/G7KO3FFB72YDKPDKLRBDMPYK7I/graph.json","fetch_events":"https://pith.science/api/pith-number/G7KO3FFB72YDKPDKLRBDMPYK7I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G7KO3FFB72YDKPDKLRBDMPYK7I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G7KO3FFB72YDKPDKLRBDMPYK7I/action/storage_attestation","attest_author":"https://pith.science/pith/G7KO3FFB72YDKPDKLRBDMPYK7I/action/author_attestation","sign_citation":"https://pith.science/pith/G7KO3FFB72YDKPDKLRBDMPYK7I/action/citation_signature","submit_replication":"https://pith.science/pith/G7KO3FFB72YDKPDKLRBDMPYK7I/action/replication_record"}},"created_at":"2026-05-18T03:44:23.619056+00:00","updated_at":"2026-05-18T03:44:23.619056+00:00"}