{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VC6F5HWCELBVVYZGL5OH4GROUB","short_pith_number":"pith:VC6F5HWC","schema_version":"1.0","canonical_sha256":"a8bc5e9ec222c35ae3265f5c7e1a2ea076c30bfd7cbd3ee571992b850ab1c715","source":{"kind":"arxiv","id":"1501.07549","version":1},"attestation_state":"computed","paper":{"title":"Equimatchable factor-critical graphs and independence number 2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eduard Eiben, Michal Kotrbcik","submitted_at":"2015-01-29T19:14:39Z","abstract_excerpt":"A graph is equimatchable if each of its matchings is a subset of a maximum matching. It is known that any 2-connected equimatchable graph is either bipartite, or factor-critical, and that these two classes are disjoint. This paper provides a description of k-connected equimatchable factor-critical graphs with respect to their k-cuts for $k\\ge 3$. As our main result we prove that if G is a k-connected equimatchable factor-critical graph with at least 2k+3 vertices and a k-cut S, then G-S has exactly two components and both these components are close to being complete or complete bipartite. If b"},"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":"1501.07549","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-29T19:14:39Z","cross_cats_sorted":[],"title_canon_sha256":"2d45b3ecbded52895cbcca3ddcef62f760bb1d25871e58f4ba57e1060bec495b","abstract_canon_sha256":"7243de904e3645094f627a242dab20d478ef1c45a771c64ecd48be1b8be314ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:21.675085Z","signature_b64":"k65SNxiPPXOZi6dOyCXTKHQlW8fqZcyIekxPg8Gmb2i5aY8eYTCKt1OKVWaqh6BT2mATtRREGV5X08xJDMOgBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8bc5e9ec222c35ae3265f5c7e1a2ea076c30bfd7cbd3ee571992b850ab1c715","last_reissued_at":"2026-05-18T02:28:21.674428Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:21.674428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Equimatchable factor-critical graphs and independence number 2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eduard Eiben, Michal Kotrbcik","submitted_at":"2015-01-29T19:14:39Z","abstract_excerpt":"A graph is equimatchable if each of its matchings is a subset of a maximum matching. It is known that any 2-connected equimatchable graph is either bipartite, or factor-critical, and that these two classes are disjoint. This paper provides a description of k-connected equimatchable factor-critical graphs with respect to their k-cuts for $k\\ge 3$. As our main result we prove that if G is a k-connected equimatchable factor-critical graph with at least 2k+3 vertices and a k-cut S, then G-S has exactly two components and both these components are close to being complete or complete bipartite. If b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07549","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":"1501.07549","created_at":"2026-05-18T02:28:21.674545+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.07549v1","created_at":"2026-05-18T02:28:21.674545+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07549","created_at":"2026-05-18T02:28:21.674545+00:00"},{"alias_kind":"pith_short_12","alias_value":"VC6F5HWCELBV","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"VC6F5HWCELBVVYZG","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"VC6F5HWC","created_at":"2026-05-18T12:29:44.643036+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/VC6F5HWCELBVVYZGL5OH4GROUB","json":"https://pith.science/pith/VC6F5HWCELBVVYZGL5OH4GROUB.json","graph_json":"https://pith.science/api/pith-number/VC6F5HWCELBVVYZGL5OH4GROUB/graph.json","events_json":"https://pith.science/api/pith-number/VC6F5HWCELBVVYZGL5OH4GROUB/events.json","paper":"https://pith.science/paper/VC6F5HWC"},"agent_actions":{"view_html":"https://pith.science/pith/VC6F5HWCELBVVYZGL5OH4GROUB","download_json":"https://pith.science/pith/VC6F5HWCELBVVYZGL5OH4GROUB.json","view_paper":"https://pith.science/paper/VC6F5HWC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.07549&json=true","fetch_graph":"https://pith.science/api/pith-number/VC6F5HWCELBVVYZGL5OH4GROUB/graph.json","fetch_events":"https://pith.science/api/pith-number/VC6F5HWCELBVVYZGL5OH4GROUB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VC6F5HWCELBVVYZGL5OH4GROUB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VC6F5HWCELBVVYZGL5OH4GROUB/action/storage_attestation","attest_author":"https://pith.science/pith/VC6F5HWCELBVVYZGL5OH4GROUB/action/author_attestation","sign_citation":"https://pith.science/pith/VC6F5HWCELBVVYZGL5OH4GROUB/action/citation_signature","submit_replication":"https://pith.science/pith/VC6F5HWCELBVVYZGL5OH4GROUB/action/replication_record"}},"created_at":"2026-05-18T02:28:21.674545+00:00","updated_at":"2026-05-18T02:28:21.674545+00:00"}