{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:UHZBSM25CBJFDD72PIXTODNR6L","short_pith_number":"pith:UHZBSM25","schema_version":"1.0","canonical_sha256":"a1f219335d1052518ffa7a2f370db1f2eaf76c775eaeaaafdd679e8c9d24c514","source":{"kind":"arxiv","id":"1011.5443","version":2},"attestation_state":"computed","paper":{"title":"Corr\\'adi and Hajnal's theorem for sparse random graphs","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Choongbum Lee, J\\'ozsef Balogh, Wojciech Samotij","submitted_at":"2010-11-24T17:52:10Z","abstract_excerpt":"In this paper we extend a classical theorem of Corr\\'adi and Hajnal into the setting of sparse random graphs. We show that if $p(n) \\gg (\\log n / n)^{1/2}$, then asymptotically almost surely every subgraph of $G(n,p)$ with minimum degree at least $(2/3 + o(1))np$ contains a triangle packing that covers all but at most $O(p^{-2})$ vertices. Moreover, the assumption on $p$ is optimal up to the $(\\log n)^{1/2}$ factor and the presence of the set of $O(p^{-2})$ uncovered vertices is indispensable. The main ingredient in the proof, which might be of independent interest, is an embedding theorem whi"},"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":"1011.5443","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2010-11-24T17:52:10Z","cross_cats_sorted":[],"title_canon_sha256":"be89f19185fbefc2a37a87f39f16a8e9b5ce0940799f50fad2cece11bc8225e2","abstract_canon_sha256":"12a248cc742eb3eaab4f5d7aeaabf43ddf64f0d66283e3bef61216c3bd109bd3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:53.726292Z","signature_b64":"WG+a9EuRX4OD3cgKQWGbWZihjQlgrHq64zZz6/1r0aol9q743baah+ZD3hGKr4Q+X7Jzw5vHHgR9C29E8yfgDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1f219335d1052518ffa7a2f370db1f2eaf76c775eaeaaafdd679e8c9d24c514","last_reissued_at":"2026-05-18T04:09:53.725621Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:53.725621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Corr\\'adi and Hajnal's theorem for sparse random graphs","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Choongbum Lee, J\\'ozsef Balogh, Wojciech Samotij","submitted_at":"2010-11-24T17:52:10Z","abstract_excerpt":"In this paper we extend a classical theorem of Corr\\'adi and Hajnal into the setting of sparse random graphs. We show that if $p(n) \\gg (\\log n / n)^{1/2}$, then asymptotically almost surely every subgraph of $G(n,p)$ with minimum degree at least $(2/3 + o(1))np$ contains a triangle packing that covers all but at most $O(p^{-2})$ vertices. Moreover, the assumption on $p$ is optimal up to the $(\\log n)^{1/2}$ factor and the presence of the set of $O(p^{-2})$ uncovered vertices is indispensable. The main ingredient in the proof, which might be of independent interest, is an embedding theorem whi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5443","kind":"arxiv","version":2},"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":"1011.5443","created_at":"2026-05-18T04:09:53.725715+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.5443v2","created_at":"2026-05-18T04:09:53.725715+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5443","created_at":"2026-05-18T04:09:53.725715+00:00"},{"alias_kind":"pith_short_12","alias_value":"UHZBSM25CBJF","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"UHZBSM25CBJFDD72","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"UHZBSM25","created_at":"2026-05-18T12:26:15.391820+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/UHZBSM25CBJFDD72PIXTODNR6L","json":"https://pith.science/pith/UHZBSM25CBJFDD72PIXTODNR6L.json","graph_json":"https://pith.science/api/pith-number/UHZBSM25CBJFDD72PIXTODNR6L/graph.json","events_json":"https://pith.science/api/pith-number/UHZBSM25CBJFDD72PIXTODNR6L/events.json","paper":"https://pith.science/paper/UHZBSM25"},"agent_actions":{"view_html":"https://pith.science/pith/UHZBSM25CBJFDD72PIXTODNR6L","download_json":"https://pith.science/pith/UHZBSM25CBJFDD72PIXTODNR6L.json","view_paper":"https://pith.science/paper/UHZBSM25","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.5443&json=true","fetch_graph":"https://pith.science/api/pith-number/UHZBSM25CBJFDD72PIXTODNR6L/graph.json","fetch_events":"https://pith.science/api/pith-number/UHZBSM25CBJFDD72PIXTODNR6L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UHZBSM25CBJFDD72PIXTODNR6L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UHZBSM25CBJFDD72PIXTODNR6L/action/storage_attestation","attest_author":"https://pith.science/pith/UHZBSM25CBJFDD72PIXTODNR6L/action/author_attestation","sign_citation":"https://pith.science/pith/UHZBSM25CBJFDD72PIXTODNR6L/action/citation_signature","submit_replication":"https://pith.science/pith/UHZBSM25CBJFDD72PIXTODNR6L/action/replication_record"}},"created_at":"2026-05-18T04:09:53.725715+00:00","updated_at":"2026-05-18T04:09:53.725715+00:00"}