{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:UOJE55IHFOXRQMQZBZEXYIVHTS","short_pith_number":"pith:UOJE55IH","schema_version":"1.0","canonical_sha256":"a3924ef5072baf1832190e497c22a79c826b1899211938d0b7a154d36eeb34ca","source":{"kind":"arxiv","id":"1312.3423","version":1},"attestation_state":"computed","paper":{"title":"2-connected equimatchable graphs on surfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eduard Eiben, Michal Kotrb\\v{c}\\'ik","submitted_at":"2013-12-12T09:19:33Z","abstract_excerpt":"A graph $G$ is equimatchable if any matching in $G$ is a subset of a maximum-size matching. It is known that any $2$-connected equimatchable graph is either bipartite or factor-critical. We prove that for any vertex $v$ of a $2$-connected factor-critical equimatchable graph $G$ and a minimal matching $M$ that isolates $v$ the graph $G\\setminus(M\\cup\\{ v\\})$ is either $K_{2n}$ or $K_{n,n}$ for some $n$. We use this result to improve the upper bounds on the maximum size of $2$-connected equimatchable factor-critical graphs embeddable in the orientable surface of genus $g$ to $4\\sqrt g+17$ if $g\\"},"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":"1312.3423","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-12T09:19:33Z","cross_cats_sorted":[],"title_canon_sha256":"d69dc1c2f1283b8dc62923ab05b9b9e85e71ca8785aa1b3e6519d47b29df82c8","abstract_canon_sha256":"7a7acd6af4e83f365ce69d776b2be2a1e936e6d6b2cea581219921a7af9f78b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:58.567729Z","signature_b64":"NXc3RGIPqtfMbz+GYWGGYY+QohuwXDsKg4Nrk8lEkEimdTj9P6aG4wrpmd+FdqKc4ug3SRxxZ5+EmE0idWAqBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3924ef5072baf1832190e497c22a79c826b1899211938d0b7a154d36eeb34ca","last_reissued_at":"2026-05-18T03:04:58.566970Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:58.566970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"2-connected equimatchable graphs on surfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eduard Eiben, Michal Kotrb\\v{c}\\'ik","submitted_at":"2013-12-12T09:19:33Z","abstract_excerpt":"A graph $G$ is equimatchable if any matching in $G$ is a subset of a maximum-size matching. It is known that any $2$-connected equimatchable graph is either bipartite or factor-critical. We prove that for any vertex $v$ of a $2$-connected factor-critical equimatchable graph $G$ and a minimal matching $M$ that isolates $v$ the graph $G\\setminus(M\\cup\\{ v\\})$ is either $K_{2n}$ or $K_{n,n}$ for some $n$. We use this result to improve the upper bounds on the maximum size of $2$-connected equimatchable factor-critical graphs embeddable in the orientable surface of genus $g$ to $4\\sqrt g+17$ if $g\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3423","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":"1312.3423","created_at":"2026-05-18T03:04:58.567096+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.3423v1","created_at":"2026-05-18T03:04:58.567096+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3423","created_at":"2026-05-18T03:04:58.567096+00:00"},{"alias_kind":"pith_short_12","alias_value":"UOJE55IHFOXR","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"UOJE55IHFOXRQMQZ","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"UOJE55IH","created_at":"2026-05-18T12:28:02.375192+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/UOJE55IHFOXRQMQZBZEXYIVHTS","json":"https://pith.science/pith/UOJE55IHFOXRQMQZBZEXYIVHTS.json","graph_json":"https://pith.science/api/pith-number/UOJE55IHFOXRQMQZBZEXYIVHTS/graph.json","events_json":"https://pith.science/api/pith-number/UOJE55IHFOXRQMQZBZEXYIVHTS/events.json","paper":"https://pith.science/paper/UOJE55IH"},"agent_actions":{"view_html":"https://pith.science/pith/UOJE55IHFOXRQMQZBZEXYIVHTS","download_json":"https://pith.science/pith/UOJE55IHFOXRQMQZBZEXYIVHTS.json","view_paper":"https://pith.science/paper/UOJE55IH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.3423&json=true","fetch_graph":"https://pith.science/api/pith-number/UOJE55IHFOXRQMQZBZEXYIVHTS/graph.json","fetch_events":"https://pith.science/api/pith-number/UOJE55IHFOXRQMQZBZEXYIVHTS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UOJE55IHFOXRQMQZBZEXYIVHTS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UOJE55IHFOXRQMQZBZEXYIVHTS/action/storage_attestation","attest_author":"https://pith.science/pith/UOJE55IHFOXRQMQZBZEXYIVHTS/action/author_attestation","sign_citation":"https://pith.science/pith/UOJE55IHFOXRQMQZBZEXYIVHTS/action/citation_signature","submit_replication":"https://pith.science/pith/UOJE55IHFOXRQMQZBZEXYIVHTS/action/replication_record"}},"created_at":"2026-05-18T03:04:58.567096+00:00","updated_at":"2026-05-18T03:04:58.567096+00:00"}