{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6L4JJ3UNAA43VQERL7ZQ45LS2P","short_pith_number":"pith:6L4JJ3UN","schema_version":"1.0","canonical_sha256":"f2f894ee8d0039bac0915ff30e7572d3d555147722d6aa11fd78f327a41233e8","source":{"kind":"arxiv","id":"1703.00273","version":1},"attestation_state":"computed","paper":{"title":"Smaller subgraphs of minimum degree k","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andreas Noever, Frank Mousset, Nemanja \\v{S}kori\\'c","submitted_at":"2017-03-01T12:51:51Z","abstract_excerpt":"In 1990 Erd\\H{o}s, Faudree, Rousseau and Schelp proved that for $k\\geq 2$, every graph with $n\\geq k+1$ vertices and $(k-1)(n-k+2)+\\binom{k-2}{2}+1$ edges contains a subgraph of minimum degree $k$ on at most $n-\\sqrt{n}/\\sqrt{6k^3}$ vertices. They conjectured that it is possible to remove at least $\\epsilon_k n$ many vertices and remain with a subgraph of minimum degree $k$, for some $\\epsilon_k>0$. We make progress towards their conjecture by showing that one can remove at least $\\Omega(n/\\log n)$ many vertices."},"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":"1703.00273","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-01T12:51:51Z","cross_cats_sorted":[],"title_canon_sha256":"611a71b2056ccf52e30f865a6537960b861d118ef9c1594d91052ff246b55aa7","abstract_canon_sha256":"6baa1054c71ffd26033ab68abf29ccbd9f613ce585a0c607eb27d86527ece909"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:45.386831Z","signature_b64":"rzMJHKL9FwReQIBDhSL8yh+J92bfzRcLqcMffNvyswhxKn8gaxI71M1cm9qPjjfZJAIyx6M1PFwv+BtUeD0ICw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2f894ee8d0039bac0915ff30e7572d3d555147722d6aa11fd78f327a41233e8","last_reissued_at":"2026-05-18T00:49:45.386106Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:45.386106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Smaller subgraphs of minimum degree k","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andreas Noever, Frank Mousset, Nemanja \\v{S}kori\\'c","submitted_at":"2017-03-01T12:51:51Z","abstract_excerpt":"In 1990 Erd\\H{o}s, Faudree, Rousseau and Schelp proved that for $k\\geq 2$, every graph with $n\\geq k+1$ vertices and $(k-1)(n-k+2)+\\binom{k-2}{2}+1$ edges contains a subgraph of minimum degree $k$ on at most $n-\\sqrt{n}/\\sqrt{6k^3}$ vertices. They conjectured that it is possible to remove at least $\\epsilon_k n$ many vertices and remain with a subgraph of minimum degree $k$, for some $\\epsilon_k>0$. We make progress towards their conjecture by showing that one can remove at least $\\Omega(n/\\log n)$ many vertices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00273","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":"1703.00273","created_at":"2026-05-18T00:49:45.386199+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.00273v1","created_at":"2026-05-18T00:49:45.386199+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00273","created_at":"2026-05-18T00:49:45.386199+00:00"},{"alias_kind":"pith_short_12","alias_value":"6L4JJ3UNAA43","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6L4JJ3UNAA43VQER","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6L4JJ3UN","created_at":"2026-05-18T12:31:03.183658+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/6L4JJ3UNAA43VQERL7ZQ45LS2P","json":"https://pith.science/pith/6L4JJ3UNAA43VQERL7ZQ45LS2P.json","graph_json":"https://pith.science/api/pith-number/6L4JJ3UNAA43VQERL7ZQ45LS2P/graph.json","events_json":"https://pith.science/api/pith-number/6L4JJ3UNAA43VQERL7ZQ45LS2P/events.json","paper":"https://pith.science/paper/6L4JJ3UN"},"agent_actions":{"view_html":"https://pith.science/pith/6L4JJ3UNAA43VQERL7ZQ45LS2P","download_json":"https://pith.science/pith/6L4JJ3UNAA43VQERL7ZQ45LS2P.json","view_paper":"https://pith.science/paper/6L4JJ3UN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.00273&json=true","fetch_graph":"https://pith.science/api/pith-number/6L4JJ3UNAA43VQERL7ZQ45LS2P/graph.json","fetch_events":"https://pith.science/api/pith-number/6L4JJ3UNAA43VQERL7ZQ45LS2P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6L4JJ3UNAA43VQERL7ZQ45LS2P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6L4JJ3UNAA43VQERL7ZQ45LS2P/action/storage_attestation","attest_author":"https://pith.science/pith/6L4JJ3UNAA43VQERL7ZQ45LS2P/action/author_attestation","sign_citation":"https://pith.science/pith/6L4JJ3UNAA43VQERL7ZQ45LS2P/action/citation_signature","submit_replication":"https://pith.science/pith/6L4JJ3UNAA43VQERL7ZQ45LS2P/action/replication_record"}},"created_at":"2026-05-18T00:49:45.386199+00:00","updated_at":"2026-05-18T00:49:45.386199+00:00"}