{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NOZY7T5OMZBUA3QJAZWHVJY7ZG","short_pith_number":"pith:NOZY7T5O","schema_version":"1.0","canonical_sha256":"6bb38fcfae6643406e09066c7aa71fc9a11b3e1ad1205c1ddf7f39197e19c98a","source":{"kind":"arxiv","id":"1705.09979","version":2},"attestation_state":"computed","paper":{"title":"A proof of a conjecture of Erd\\H{o}s, Faudree, Rousseau and Schelp on subgraphs of minimum degree $k$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lisa Sauermann","submitted_at":"2017-05-28T19:24:57Z","abstract_excerpt":"Erd\\H{o}s, Faudree, Rousseau and Schelp observed the following fact for every fixed integer $k\\geq 2$: Every graph on $n\\geq k-1$ vertices with at least $(k-1)(n-k+2)+{k-2\\choose 2}$ edges contains a subgraph with minimum degree at least $k$. However, there are examples in which the whole graph is the only such subgraph. Erd\\H{o}s et al. conjectured that having just one more edge implies the existence of a subgraph on at most $(1-\\varepsilon_k)n$ vertices with minimum degree at least $k$, where $\\varepsilon_k>0$ depends only on $k$. We prove this conjecture, using and extending ideas of Mousse"},"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":"1705.09979","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-28T19:24:57Z","cross_cats_sorted":[],"title_canon_sha256":"c57cc49d126fc96973f1628b741b78cbed374f2af63a7d77baae400b94d4a183","abstract_canon_sha256":"0576ce813abb5acb43b8eee6bdae2d4f10f5374f7e4c721b9e804f6c5e6567bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:14.286638Z","signature_b64":"y80ezpyDKxYCgmjE8Ioh01k2kZcn5enicZOHCWYUQ1gRdT3m1gmuJBTpqK1e3xcRE8lMz+EBO6JwbJ/FNgo+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bb38fcfae6643406e09066c7aa71fc9a11b3e1ad1205c1ddf7f39197e19c98a","last_reissued_at":"2026-05-18T00:12:14.285910Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:14.285910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A proof of a conjecture of Erd\\H{o}s, Faudree, Rousseau and Schelp on subgraphs of minimum degree $k$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lisa Sauermann","submitted_at":"2017-05-28T19:24:57Z","abstract_excerpt":"Erd\\H{o}s, Faudree, Rousseau and Schelp observed the following fact for every fixed integer $k\\geq 2$: Every graph on $n\\geq k-1$ vertices with at least $(k-1)(n-k+2)+{k-2\\choose 2}$ edges contains a subgraph with minimum degree at least $k$. However, there are examples in which the whole graph is the only such subgraph. Erd\\H{o}s et al. conjectured that having just one more edge implies the existence of a subgraph on at most $(1-\\varepsilon_k)n$ vertices with minimum degree at least $k$, where $\\varepsilon_k>0$ depends only on $k$. We prove this conjecture, using and extending ideas of Mousse"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09979","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":"1705.09979","created_at":"2026-05-18T00:12:14.286180+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.09979v2","created_at":"2026-05-18T00:12:14.286180+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09979","created_at":"2026-05-18T00:12:14.286180+00:00"},{"alias_kind":"pith_short_12","alias_value":"NOZY7T5OMZBU","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"NOZY7T5OMZBUA3QJ","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"NOZY7T5O","created_at":"2026-05-18T12:31:34.259226+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/NOZY7T5OMZBUA3QJAZWHVJY7ZG","json":"https://pith.science/pith/NOZY7T5OMZBUA3QJAZWHVJY7ZG.json","graph_json":"https://pith.science/api/pith-number/NOZY7T5OMZBUA3QJAZWHVJY7ZG/graph.json","events_json":"https://pith.science/api/pith-number/NOZY7T5OMZBUA3QJAZWHVJY7ZG/events.json","paper":"https://pith.science/paper/NOZY7T5O"},"agent_actions":{"view_html":"https://pith.science/pith/NOZY7T5OMZBUA3QJAZWHVJY7ZG","download_json":"https://pith.science/pith/NOZY7T5OMZBUA3QJAZWHVJY7ZG.json","view_paper":"https://pith.science/paper/NOZY7T5O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.09979&json=true","fetch_graph":"https://pith.science/api/pith-number/NOZY7T5OMZBUA3QJAZWHVJY7ZG/graph.json","fetch_events":"https://pith.science/api/pith-number/NOZY7T5OMZBUA3QJAZWHVJY7ZG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NOZY7T5OMZBUA3QJAZWHVJY7ZG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NOZY7T5OMZBUA3QJAZWHVJY7ZG/action/storage_attestation","attest_author":"https://pith.science/pith/NOZY7T5OMZBUA3QJAZWHVJY7ZG/action/author_attestation","sign_citation":"https://pith.science/pith/NOZY7T5OMZBUA3QJAZWHVJY7ZG/action/citation_signature","submit_replication":"https://pith.science/pith/NOZY7T5OMZBUA3QJAZWHVJY7ZG/action/replication_record"}},"created_at":"2026-05-18T00:12:14.286180+00:00","updated_at":"2026-05-18T00:12:14.286180+00:00"}