{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EBNZNBC6E3X22EQ5OKFDXOPG36","short_pith_number":"pith:EBNZNBC6","schema_version":"1.0","canonical_sha256":"205b96845e26efad121d728a3bb9e6dfa365160a063e5e5d316c9c9296c8c91f","source":{"kind":"arxiv","id":"1904.11571","version":1},"attestation_state":"computed","paper":{"title":"Structure of the largest subgraphs of $G_{n,p}$ with a given matching number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abigail Raz","submitted_at":"2019-04-25T20:23:08Z","abstract_excerpt":"This paper examines the structure of the largest subgraphs of the Erd\\H{o}s-R\\'enyi random graph, $G_{n,p}$, with a given matching number. This extends a result of Erd\\H{o}s and Gallai who, in 1959, gave a classification of the structures of the largest subgraphs of $K_n$ with a given matching number. We show that their result extends to $G_{n,p}$ with high probability when $p\\ge \\frac{8 \\ln n}{n}$ or $p \\ll \\frac{1}{n}$, but that it does not extend (again with high probability) when $\\frac{4\\ln(2e)}{n} < p< \\frac{\\ln n}{3n}$."},"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":"1904.11571","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-25T20:23:08Z","cross_cats_sorted":[],"title_canon_sha256":"4ea6632f08c0c7d94ef8321b9e5e360e5df1e6618395674e230f62f0799bef57","abstract_canon_sha256":"3bb2f6c28e1892301e06d929ead7e312a66bd4cf95f09a456bf26c140deaf4df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:43.356558Z","signature_b64":"8bdersP9NKCrq1gJQ1R7U9M19Ax7AqKqXk7zYaMeGmuoJZp7zjbb+i7YONB5jQ317bIBL0QHNCAJ18LRchZ0AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"205b96845e26efad121d728a3bb9e6dfa365160a063e5e5d316c9c9296c8c91f","last_reissued_at":"2026-05-17T23:47:43.355996Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:43.355996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structure of the largest subgraphs of $G_{n,p}$ with a given matching number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abigail Raz","submitted_at":"2019-04-25T20:23:08Z","abstract_excerpt":"This paper examines the structure of the largest subgraphs of the Erd\\H{o}s-R\\'enyi random graph, $G_{n,p}$, with a given matching number. This extends a result of Erd\\H{o}s and Gallai who, in 1959, gave a classification of the structures of the largest subgraphs of $K_n$ with a given matching number. We show that their result extends to $G_{n,p}$ with high probability when $p\\ge \\frac{8 \\ln n}{n}$ or $p \\ll \\frac{1}{n}$, but that it does not extend (again with high probability) when $\\frac{4\\ln(2e)}{n} < p< \\frac{\\ln n}{3n}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11571","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":"1904.11571","created_at":"2026-05-17T23:47:43.356083+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.11571v1","created_at":"2026-05-17T23:47:43.356083+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11571","created_at":"2026-05-17T23:47:43.356083+00:00"},{"alias_kind":"pith_short_12","alias_value":"EBNZNBC6E3X2","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"EBNZNBC6E3X22EQ5","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"EBNZNBC6","created_at":"2026-05-18T12:33:15.570797+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/EBNZNBC6E3X22EQ5OKFDXOPG36","json":"https://pith.science/pith/EBNZNBC6E3X22EQ5OKFDXOPG36.json","graph_json":"https://pith.science/api/pith-number/EBNZNBC6E3X22EQ5OKFDXOPG36/graph.json","events_json":"https://pith.science/api/pith-number/EBNZNBC6E3X22EQ5OKFDXOPG36/events.json","paper":"https://pith.science/paper/EBNZNBC6"},"agent_actions":{"view_html":"https://pith.science/pith/EBNZNBC6E3X22EQ5OKFDXOPG36","download_json":"https://pith.science/pith/EBNZNBC6E3X22EQ5OKFDXOPG36.json","view_paper":"https://pith.science/paper/EBNZNBC6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.11571&json=true","fetch_graph":"https://pith.science/api/pith-number/EBNZNBC6E3X22EQ5OKFDXOPG36/graph.json","fetch_events":"https://pith.science/api/pith-number/EBNZNBC6E3X22EQ5OKFDXOPG36/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EBNZNBC6E3X22EQ5OKFDXOPG36/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EBNZNBC6E3X22EQ5OKFDXOPG36/action/storage_attestation","attest_author":"https://pith.science/pith/EBNZNBC6E3X22EQ5OKFDXOPG36/action/author_attestation","sign_citation":"https://pith.science/pith/EBNZNBC6E3X22EQ5OKFDXOPG36/action/citation_signature","submit_replication":"https://pith.science/pith/EBNZNBC6E3X22EQ5OKFDXOPG36/action/replication_record"}},"created_at":"2026-05-17T23:47:43.356083+00:00","updated_at":"2026-05-17T23:47:43.356083+00:00"}