{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:N3SUNISLPYQWFIS6I4J5X6NEFJ","short_pith_number":"pith:N3SUNISL","schema_version":"1.0","canonical_sha256":"6ee546a24b7e2162a25e4713dbf9a42a50c274429b969571233a7ef7d1e7030c","source":{"kind":"arxiv","id":"0907.3815","version":3},"attestation_state":"computed","paper":{"title":"Dense H-free graphs are almost (\\chi(H)-1)-partite","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Peter Allen (DIMAP, University of Warwick)","submitted_at":"2009-07-22T11:05:35Z","abstract_excerpt":"By using the Szemer\\'edi Regularity Lemma, Alon and Sudakov recently extended the classical Andr\\'asfai-Erd\\~os-S\\'os theorem to cover general graphs. We prove, without using the Regularity Lemma, that the following stronger statement is true. Given any (r-1)-partite graph H whose smallest part has t vertices, and any fixed c>0, there exists a constant C such that whenever G is an n-vertex graph with minimum degree at least ((3r-4)/(3r-1)+c)n, either G contains H, or we can delete at most Cn^(2-1/t) edges from G to yield an r-partite graph."},"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":"0907.3815","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-07-22T11:05:35Z","cross_cats_sorted":[],"title_canon_sha256":"1486db56b3166373a2cc7732dd775084fc824aaafec1274fab45bc8ea2d26e10","abstract_canon_sha256":"b2d4fcfe51fb7a412b455a8e7fb5d5b09b5bd6a00ed07f54d3a177438262e373"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:36.584574Z","signature_b64":"whmEIoZxzKAp9saHJyISu28PPJhea1Upt8rXDygxhCY8oKxo0NV6jwDhdm6MAazBk1vHhtILhSQCM8AUPM31BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ee546a24b7e2162a25e4713dbf9a42a50c274429b969571233a7ef7d1e7030c","last_reissued_at":"2026-05-18T04:28:36.584185Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:36.584185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dense H-free graphs are almost (\\chi(H)-1)-partite","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Peter Allen (DIMAP, University of Warwick)","submitted_at":"2009-07-22T11:05:35Z","abstract_excerpt":"By using the Szemer\\'edi Regularity Lemma, Alon and Sudakov recently extended the classical Andr\\'asfai-Erd\\~os-S\\'os theorem to cover general graphs. We prove, without using the Regularity Lemma, that the following stronger statement is true. Given any (r-1)-partite graph H whose smallest part has t vertices, and any fixed c>0, there exists a constant C such that whenever G is an n-vertex graph with minimum degree at least ((3r-4)/(3r-1)+c)n, either G contains H, or we can delete at most Cn^(2-1/t) edges from G to yield an r-partite graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.3815","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":"0907.3815","created_at":"2026-05-18T04:28:36.584236+00:00"},{"alias_kind":"arxiv_version","alias_value":"0907.3815v3","created_at":"2026-05-18T04:28:36.584236+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.3815","created_at":"2026-05-18T04:28:36.584236+00:00"},{"alias_kind":"pith_short_12","alias_value":"N3SUNISLPYQW","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"N3SUNISLPYQWFIS6","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"N3SUNISL","created_at":"2026-05-18T12:26:00.592388+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/N3SUNISLPYQWFIS6I4J5X6NEFJ","json":"https://pith.science/pith/N3SUNISLPYQWFIS6I4J5X6NEFJ.json","graph_json":"https://pith.science/api/pith-number/N3SUNISLPYQWFIS6I4J5X6NEFJ/graph.json","events_json":"https://pith.science/api/pith-number/N3SUNISLPYQWFIS6I4J5X6NEFJ/events.json","paper":"https://pith.science/paper/N3SUNISL"},"agent_actions":{"view_html":"https://pith.science/pith/N3SUNISLPYQWFIS6I4J5X6NEFJ","download_json":"https://pith.science/pith/N3SUNISLPYQWFIS6I4J5X6NEFJ.json","view_paper":"https://pith.science/paper/N3SUNISL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0907.3815&json=true","fetch_graph":"https://pith.science/api/pith-number/N3SUNISLPYQWFIS6I4J5X6NEFJ/graph.json","fetch_events":"https://pith.science/api/pith-number/N3SUNISLPYQWFIS6I4J5X6NEFJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N3SUNISLPYQWFIS6I4J5X6NEFJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N3SUNISLPYQWFIS6I4J5X6NEFJ/action/storage_attestation","attest_author":"https://pith.science/pith/N3SUNISLPYQWFIS6I4J5X6NEFJ/action/author_attestation","sign_citation":"https://pith.science/pith/N3SUNISLPYQWFIS6I4J5X6NEFJ/action/citation_signature","submit_replication":"https://pith.science/pith/N3SUNISLPYQWFIS6I4J5X6NEFJ/action/replication_record"}},"created_at":"2026-05-18T04:28:36.584236+00:00","updated_at":"2026-05-18T04:28:36.584236+00:00"}