{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:BHGHBU3QXPPTZWNLYDNPSUHOGR","short_pith_number":"pith:BHGHBU3Q","schema_version":"1.0","canonical_sha256":"09cc70d370bbdf3cd9abc0daf950ee3461ef2b423331a543f4dadc60716d03dc","source":{"kind":"arxiv","id":"2507.03264","version":1},"attestation_state":"computed","paper":{"title":"Minimum degree and sparse connected spanning subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ting Huang, Yanbo Zhang, Yaojun Chen","submitted_at":"2025-07-04T02:48:45Z","abstract_excerpt":"Let $G$ be a connected graph on $n$ vertices and at most $n(1+\\epsilon)$ edges with bounded maximum degree, and $F$ a graph on $n$ vertices with minimum degree at least $n-k$, where $\\epsilon$ is a constant depending on $k$. In this paper, we prove that $F$ contains $G$ as a spanning subgraph provided $n\\ge 6k^3$, by establishing tight bounds for the Ramsey number $r(G,K_{1,k})$, where $K_{1,k}$ is a star on $k+1$ vertices. Our result generalizes and refines the work of Erd\\H{o}s, Faudree, Rousseau, and Schelp (JCT-B, 1982), who established the corresponding result for $G$ being a tree. Moreov"},"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":"2507.03264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-04T02:48:45Z","cross_cats_sorted":[],"title_canon_sha256":"004be933ec25fdb86c02096313525019eae29766ea39806d99cfda0fd325930a","abstract_canon_sha256":"ce0a06f9f7eea9bf3e39c4d9ff20a93056aa2b9358b920eaef785c82bd2d92e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:31:55.791128Z","signature_b64":"6ZtdyEIQRC2JvspjufFhhCyYglOftXmBQRsRifARYEeTmrPGoUEMPa2A2FBfUmnOTaHjQGJStv+FVi0B+CKKBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09cc70d370bbdf3cd9abc0daf950ee3461ef2b423331a543f4dadc60716d03dc","last_reissued_at":"2026-07-05T11:31:55.790647Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:31:55.790647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum degree and sparse connected spanning subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ting Huang, Yanbo Zhang, Yaojun Chen","submitted_at":"2025-07-04T02:48:45Z","abstract_excerpt":"Let $G$ be a connected graph on $n$ vertices and at most $n(1+\\epsilon)$ edges with bounded maximum degree, and $F$ a graph on $n$ vertices with minimum degree at least $n-k$, where $\\epsilon$ is a constant depending on $k$. In this paper, we prove that $F$ contains $G$ as a spanning subgraph provided $n\\ge 6k^3$, by establishing tight bounds for the Ramsey number $r(G,K_{1,k})$, where $K_{1,k}$ is a star on $k+1$ vertices. Our result generalizes and refines the work of Erd\\H{o}s, Faudree, Rousseau, and Schelp (JCT-B, 1982), who established the corresponding result for $G$ being a tree. Moreov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.03264","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.03264/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2507.03264","created_at":"2026-07-05T11:31:55.790709+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.03264v1","created_at":"2026-07-05T11:31:55.790709+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.03264","created_at":"2026-07-05T11:31:55.790709+00:00"},{"alias_kind":"pith_short_12","alias_value":"BHGHBU3QXPPT","created_at":"2026-07-05T11:31:55.790709+00:00"},{"alias_kind":"pith_short_16","alias_value":"BHGHBU3QXPPTZWNL","created_at":"2026-07-05T11:31:55.790709+00:00"},{"alias_kind":"pith_short_8","alias_value":"BHGHBU3Q","created_at":"2026-07-05T11:31:55.790709+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.09832","citing_title":"Fan-goodness of sparse graphs","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BHGHBU3QXPPTZWNLYDNPSUHOGR","json":"https://pith.science/pith/BHGHBU3QXPPTZWNLYDNPSUHOGR.json","graph_json":"https://pith.science/api/pith-number/BHGHBU3QXPPTZWNLYDNPSUHOGR/graph.json","events_json":"https://pith.science/api/pith-number/BHGHBU3QXPPTZWNLYDNPSUHOGR/events.json","paper":"https://pith.science/paper/BHGHBU3Q"},"agent_actions":{"view_html":"https://pith.science/pith/BHGHBU3QXPPTZWNLYDNPSUHOGR","download_json":"https://pith.science/pith/BHGHBU3QXPPTZWNLYDNPSUHOGR.json","view_paper":"https://pith.science/paper/BHGHBU3Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.03264&json=true","fetch_graph":"https://pith.science/api/pith-number/BHGHBU3QXPPTZWNLYDNPSUHOGR/graph.json","fetch_events":"https://pith.science/api/pith-number/BHGHBU3QXPPTZWNLYDNPSUHOGR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BHGHBU3QXPPTZWNLYDNPSUHOGR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BHGHBU3QXPPTZWNLYDNPSUHOGR/action/storage_attestation","attest_author":"https://pith.science/pith/BHGHBU3QXPPTZWNLYDNPSUHOGR/action/author_attestation","sign_citation":"https://pith.science/pith/BHGHBU3QXPPTZWNLYDNPSUHOGR/action/citation_signature","submit_replication":"https://pith.science/pith/BHGHBU3QXPPTZWNLYDNPSUHOGR/action/replication_record"}},"created_at":"2026-07-05T11:31:55.790709+00:00","updated_at":"2026-07-05T11:31:55.790709+00:00"}