{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:2IBRHLEGDK2RRXYEGE4EKSK7PA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fbc1ef08da4f247846d9bd1dc1834c948fe9315840ac29205efd789912a0ce08","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-21T01:47:19Z","title_canon_sha256":"d1221ca324f6f835b64414ba4faf24fc2dc0875d53316b5776ccc008eeb98a54"},"schema_version":"1.0","source":{"id":"1903.08795","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.08795","created_at":"2026-05-17T23:50:43Z"},{"alias_kind":"arxiv_version","alias_value":"1903.08795v1","created_at":"2026-05-17T23:50:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.08795","created_at":"2026-05-17T23:50:43Z"},{"alias_kind":"pith_short_12","alias_value":"2IBRHLEGDK2R","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2IBRHLEGDK2RRXYE","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2IBRHLEG","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:337c18865dbfbf592f62bdb5b524f4bf35715c9b4a99a8846a0e289365bbd3c2","target":"graph","created_at":"2026-05-17T23:50:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Alexandr Kostochka, Boram Park, Douglas B. West, Ilkyoo Choi, Ringi Kim","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-21T01:47:19Z","title":"Largest 2-regular subgraphs in 3-regular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.08795","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cda47e9a5d7e4b1b361844db2d654006a749767fe7553a935b09167654a61f58","target":"record","created_at":"2026-05-17T23:50:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fbc1ef08da4f247846d9bd1dc1834c948fe9315840ac29205efd789912a0ce08","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-21T01:47:19Z","title_canon_sha256":"d1221ca324f6f835b64414ba4faf24fc2dc0875d53316b5776ccc008eeb98a54"},"schema_version":"1.0","source":{"id":"1903.08795","kind":"arxiv","version":1}},"canonical_sha256":"d20313ac861ab518df04313845495f78326ca0d0911578aae9bd4eae85fa0451","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d20313ac861ab518df04313845495f78326ca0d0911578aae9bd4eae85fa0451","first_computed_at":"2026-05-17T23:50:43.903471Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:43.903471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L94qddZwsnSPa2+Bj/vLp9jUxX1GL++bzFHQag1W483nK3Npuqe9fUvrBYFowVGrfL+o0bcNih/Xf/tgLDocDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:43.903829Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.08795","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cda47e9a5d7e4b1b361844db2d654006a749767fe7553a935b09167654a61f58","sha256:337c18865dbfbf592f62bdb5b524f4bf35715c9b4a99a8846a0e289365bbd3c2"],"state_sha256":"4c7cd481aeba5151eec2f5ea58bc55ccdc8a129211b250e7e591d5b59846b987"}