{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SD66A4WRYW5Z2NDE4DDVF2NOWS","short_pith_number":"pith:SD66A4WR","schema_version":"1.0","canonical_sha256":"90fde072d1c5bb9d3464e0c752e9aeb4ac5f26c66d768543383813f12230c959","source":{"kind":"arxiv","id":"1902.07812","version":1},"attestation_state":"computed","paper":{"title":"Finding big matchings in planar graphs quickly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Therese Biedl","submitted_at":"2019-02-20T23:39:40Z","abstract_excerpt":"It is well-known that every $n$-vertex planar graph with minimum degree 3 has a matching of size at least $\\frac{n}{3}$. But all proofs of this use the Tutte-Berge-formula for the size of a maximum matching. Hence these proofs are not directly algorithmic, and to find such a matching one must apply a general-purposes maximum matching algorithm, which has run-time $O(n^{1.5}\\alpha(n))$ for planar graphs. In contrast to this, this paper gives a linear-time algorithm that finds a matching of size at least $\\frac{n}{3}$ in any planar graph with minimum degree 3."},"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":"1902.07812","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-20T23:39:40Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"53e150bcbdc599f5d4ca04b9fa8431b407e31f5a2e1729a20f1a8cd5267d0484","abstract_canon_sha256":"5cc189250067c33600b370d5a9ca67dc4aa1a500d674a44889a42970f3e988cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:03.822794Z","signature_b64":"VC3NKvk+mMps0eqLlC16OeRLCqBBn11xKZGNZ80641zjHep7oYsHNxm5GIXbgP/wgPhzlpQUP4+N+H5v3FMVBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90fde072d1c5bb9d3464e0c752e9aeb4ac5f26c66d768543383813f12230c959","last_reissued_at":"2026-05-17T23:53:03.822123Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:03.822123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding big matchings in planar graphs quickly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Therese Biedl","submitted_at":"2019-02-20T23:39:40Z","abstract_excerpt":"It is well-known that every $n$-vertex planar graph with minimum degree 3 has a matching of size at least $\\frac{n}{3}$. But all proofs of this use the Tutte-Berge-formula for the size of a maximum matching. Hence these proofs are not directly algorithmic, and to find such a matching one must apply a general-purposes maximum matching algorithm, which has run-time $O(n^{1.5}\\alpha(n))$ for planar graphs. In contrast to this, this paper gives a linear-time algorithm that finds a matching of size at least $\\frac{n}{3}$ in any planar graph with minimum degree 3."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07812","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":"1902.07812","created_at":"2026-05-17T23:53:03.822217+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.07812v1","created_at":"2026-05-17T23:53:03.822217+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07812","created_at":"2026-05-17T23:53:03.822217+00:00"},{"alias_kind":"pith_short_12","alias_value":"SD66A4WRYW5Z","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"SD66A4WRYW5Z2NDE","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"SD66A4WR","created_at":"2026-05-18T12:33:27.125529+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/SD66A4WRYW5Z2NDE4DDVF2NOWS","json":"https://pith.science/pith/SD66A4WRYW5Z2NDE4DDVF2NOWS.json","graph_json":"https://pith.science/api/pith-number/SD66A4WRYW5Z2NDE4DDVF2NOWS/graph.json","events_json":"https://pith.science/api/pith-number/SD66A4WRYW5Z2NDE4DDVF2NOWS/events.json","paper":"https://pith.science/paper/SD66A4WR"},"agent_actions":{"view_html":"https://pith.science/pith/SD66A4WRYW5Z2NDE4DDVF2NOWS","download_json":"https://pith.science/pith/SD66A4WRYW5Z2NDE4DDVF2NOWS.json","view_paper":"https://pith.science/paper/SD66A4WR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.07812&json=true","fetch_graph":"https://pith.science/api/pith-number/SD66A4WRYW5Z2NDE4DDVF2NOWS/graph.json","fetch_events":"https://pith.science/api/pith-number/SD66A4WRYW5Z2NDE4DDVF2NOWS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SD66A4WRYW5Z2NDE4DDVF2NOWS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SD66A4WRYW5Z2NDE4DDVF2NOWS/action/storage_attestation","attest_author":"https://pith.science/pith/SD66A4WRYW5Z2NDE4DDVF2NOWS/action/author_attestation","sign_citation":"https://pith.science/pith/SD66A4WRYW5Z2NDE4DDVF2NOWS/action/citation_signature","submit_replication":"https://pith.science/pith/SD66A4WRYW5Z2NDE4DDVF2NOWS/action/replication_record"}},"created_at":"2026-05-17T23:53:03.822217+00:00","updated_at":"2026-05-17T23:53:03.822217+00:00"}