{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:2IBRHLEGDK2RRXYEGE4EKSK7PA","short_pith_number":"pith:2IBRHLEG","schema_version":"1.0","canonical_sha256":"d20313ac861ab518df04313845495f78326ca0d0911578aae9bd4eae85fa0451","source":{"kind":"arxiv","id":"1903.08795","version":1},"attestation_state":"computed","paper":{"title":"Largest 2-regular subgraphs in 3-regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Kostochka, Boram Park, Douglas B. West, Ilkyoo Choi, Ringi Kim","submitted_at":"2019-03-21T01:47:19Z","abstract_excerpt":"For a graph $G$, let $f_2(G)$ denote the largest number of vertices in a $2$-regular subgraph of $G$. We determine the minimum of $f_2(G)$ over $3$-regular $n$-vertex simple graphs $G$. To do this, we prove that every $3$-regular multigraph with exactly $c$ cut-edges has a $2$-regular subgraph that omits at most $\\max\\{0,\\lfloor (c-1)/2\\rfloor\\}$ vertices. More generally, every $n$-vertex multigraph with maximum degree $3$ and $m$ edges has a $2$-regular subgraph that omits at most $\\max\\{0,\\lfloor (3n-2m+c-1)/2\\rfloor\\}$ vertices. These bounds are sharp; we describe the extremal multigraphs."},"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":"1903.08795","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-21T01:47:19Z","cross_cats_sorted":[],"title_canon_sha256":"d1221ca324f6f835b64414ba4faf24fc2dc0875d53316b5776ccc008eeb98a54","abstract_canon_sha256":"fbc1ef08da4f247846d9bd1dc1834c948fe9315840ac29205efd789912a0ce08"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:43.903829Z","signature_b64":"L94qddZwsnSPa2+Bj/vLp9jUxX1GL++bzFHQag1W483nK3Npuqe9fUvrBYFowVGrfL+o0bcNih/Xf/tgLDocDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d20313ac861ab518df04313845495f78326ca0d0911578aae9bd4eae85fa0451","last_reissued_at":"2026-05-17T23:50:43.903471Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:43.903471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Largest 2-regular subgraphs in 3-regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Kostochka, Boram Park, Douglas B. West, Ilkyoo Choi, Ringi Kim","submitted_at":"2019-03-21T01:47:19Z","abstract_excerpt":"For a graph $G$, let $f_2(G)$ denote the largest number of vertices in a $2$-regular subgraph of $G$. We determine the minimum of $f_2(G)$ over $3$-regular $n$-vertex simple graphs $G$. To do this, we prove that every $3$-regular multigraph with exactly $c$ cut-edges has a $2$-regular subgraph that omits at most $\\max\\{0,\\lfloor (c-1)/2\\rfloor\\}$ vertices. More generally, every $n$-vertex multigraph with maximum degree $3$ and $m$ edges has a $2$-regular subgraph that omits at most $\\max\\{0,\\lfloor (3n-2m+c-1)/2\\rfloor\\}$ vertices. These bounds are sharp; we describe the extremal multigraphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.08795","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":"1903.08795","created_at":"2026-05-17T23:50:43.903524+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.08795v1","created_at":"2026-05-17T23:50:43.903524+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.08795","created_at":"2026-05-17T23:50:43.903524+00:00"},{"alias_kind":"pith_short_12","alias_value":"2IBRHLEGDK2R","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"2IBRHLEGDK2RRXYE","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"2IBRHLEG","created_at":"2026-05-18T12:33:07.085635+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/2IBRHLEGDK2RRXYEGE4EKSK7PA","json":"https://pith.science/pith/2IBRHLEGDK2RRXYEGE4EKSK7PA.json","graph_json":"https://pith.science/api/pith-number/2IBRHLEGDK2RRXYEGE4EKSK7PA/graph.json","events_json":"https://pith.science/api/pith-number/2IBRHLEGDK2RRXYEGE4EKSK7PA/events.json","paper":"https://pith.science/paper/2IBRHLEG"},"agent_actions":{"view_html":"https://pith.science/pith/2IBRHLEGDK2RRXYEGE4EKSK7PA","download_json":"https://pith.science/pith/2IBRHLEGDK2RRXYEGE4EKSK7PA.json","view_paper":"https://pith.science/paper/2IBRHLEG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.08795&json=true","fetch_graph":"https://pith.science/api/pith-number/2IBRHLEGDK2RRXYEGE4EKSK7PA/graph.json","fetch_events":"https://pith.science/api/pith-number/2IBRHLEGDK2RRXYEGE4EKSK7PA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2IBRHLEGDK2RRXYEGE4EKSK7PA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2IBRHLEGDK2RRXYEGE4EKSK7PA/action/storage_attestation","attest_author":"https://pith.science/pith/2IBRHLEGDK2RRXYEGE4EKSK7PA/action/author_attestation","sign_citation":"https://pith.science/pith/2IBRHLEGDK2RRXYEGE4EKSK7PA/action/citation_signature","submit_replication":"https://pith.science/pith/2IBRHLEGDK2RRXYEGE4EKSK7PA/action/replication_record"}},"created_at":"2026-05-17T23:50:43.903524+00:00","updated_at":"2026-05-17T23:50:43.903524+00:00"}