{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DXIRR5FSN3L75VJMLYQVCFU2AS","short_pith_number":"pith:DXIRR5FS","schema_version":"1.0","canonical_sha256":"1dd118f4b26ed7fed52c5e2151169a04a2d85dbd45d864a0ecaeabb73f11856b","source":{"kind":"arxiv","id":"1706.05642","version":1},"attestation_state":"computed","paper":{"title":"$H$-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Clara Shikhelman, Noga Alon","submitted_at":"2017-06-18T13:01:12Z","abstract_excerpt":"We consider the structure of $H$-free subgraphs of graphs with high minimal degree. We prove that for every $k>m$ there exists an $\\epsilon:=\\epsilon(k,m)>0$ so that the following holds. For every graph $H$ with chromatic number $k$ from which one can delete an edge and reduce the chromatic number, and for every graph $G$ on $n>n_0(H)$ vertices in which all degrees are at least $(1-\\epsilon)n$, any subgraph of $G$ which is $H$-free and contains the maximum number of copies of the complete graph $K_m$ is $(k-1)$-colorable.\n  We also consider several extensions for the case of a general forbidde"},"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":"1706.05642","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-18T13:01:12Z","cross_cats_sorted":[],"title_canon_sha256":"c4ae1b7029ae84964f8ce7896c7c665f1a330fb351d65ebefcab60279aa3cee3","abstract_canon_sha256":"d3334fdfa404e309045502a551da72e15600213ced0739a9d8afc33315fc63e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:09.314620Z","signature_b64":"8npD8Tq8uG2NpeMFuQtfEXRl2spbElzr1WniIA735JPUJXF0nteqIa383i7oUxsM4PmsgVx5CR/yeLe4IkUaBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1dd118f4b26ed7fed52c5e2151169a04a2d85dbd45d864a0ecaeabb73f11856b","last_reissued_at":"2026-05-18T00:42:09.314150Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:09.314150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$H$-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Clara Shikhelman, Noga Alon","submitted_at":"2017-06-18T13:01:12Z","abstract_excerpt":"We consider the structure of $H$-free subgraphs of graphs with high minimal degree. We prove that for every $k>m$ there exists an $\\epsilon:=\\epsilon(k,m)>0$ so that the following holds. For every graph $H$ with chromatic number $k$ from which one can delete an edge and reduce the chromatic number, and for every graph $G$ on $n>n_0(H)$ vertices in which all degrees are at least $(1-\\epsilon)n$, any subgraph of $G$ which is $H$-free and contains the maximum number of copies of the complete graph $K_m$ is $(k-1)$-colorable.\n  We also consider several extensions for the case of a general forbidde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05642","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":"1706.05642","created_at":"2026-05-18T00:42:09.314225+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.05642v1","created_at":"2026-05-18T00:42:09.314225+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05642","created_at":"2026-05-18T00:42:09.314225+00:00"},{"alias_kind":"pith_short_12","alias_value":"DXIRR5FSN3L7","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"DXIRR5FSN3L75VJM","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"DXIRR5FS","created_at":"2026-05-18T12:31:12.930513+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/DXIRR5FSN3L75VJMLYQVCFU2AS","json":"https://pith.science/pith/DXIRR5FSN3L75VJMLYQVCFU2AS.json","graph_json":"https://pith.science/api/pith-number/DXIRR5FSN3L75VJMLYQVCFU2AS/graph.json","events_json":"https://pith.science/api/pith-number/DXIRR5FSN3L75VJMLYQVCFU2AS/events.json","paper":"https://pith.science/paper/DXIRR5FS"},"agent_actions":{"view_html":"https://pith.science/pith/DXIRR5FSN3L75VJMLYQVCFU2AS","download_json":"https://pith.science/pith/DXIRR5FSN3L75VJMLYQVCFU2AS.json","view_paper":"https://pith.science/paper/DXIRR5FS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.05642&json=true","fetch_graph":"https://pith.science/api/pith-number/DXIRR5FSN3L75VJMLYQVCFU2AS/graph.json","fetch_events":"https://pith.science/api/pith-number/DXIRR5FSN3L75VJMLYQVCFU2AS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DXIRR5FSN3L75VJMLYQVCFU2AS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DXIRR5FSN3L75VJMLYQVCFU2AS/action/storage_attestation","attest_author":"https://pith.science/pith/DXIRR5FSN3L75VJMLYQVCFU2AS/action/author_attestation","sign_citation":"https://pith.science/pith/DXIRR5FSN3L75VJMLYQVCFU2AS/action/citation_signature","submit_replication":"https://pith.science/pith/DXIRR5FSN3L75VJMLYQVCFU2AS/action/replication_record"}},"created_at":"2026-05-18T00:42:09.314225+00:00","updated_at":"2026-05-18T00:42:09.314225+00:00"}