{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VIG4GUH6RID6EAEJD6IYM6DF52","short_pith_number":"pith:VIG4GUH6","schema_version":"1.0","canonical_sha256":"aa0dc350fe8a07e200891f91867865ee9979bd9082a6431de348490511934d00","source":{"kind":"arxiv","id":"1310.1879","version":1},"attestation_state":"computed","paper":{"title":"Graphs with the Fewest Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A.J. Radcliffe, L. Keough","submitted_at":"2013-10-07T18:24:22Z","abstract_excerpt":"In recent years there has been increased interest in extremal problems for \"counting\" parameters of graphs. For example, the Kahn-Zhao theorem gives an upper bound on the number of independent sets in a $d$-regular graph. In the same spirit, the Upper Matching Conjecture claims an upper bound on the number of $k$-matchings in a $d$-regular graph. Here we consider both matchings and matchings of fixed sizes in graphs with a given number vertices and edges. We prove that the graph with the fewest matchings is either the lex or the colex graph. Similarly, for fixed $k$, the graph with the fewest "},"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":"1310.1879","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-07T18:24:22Z","cross_cats_sorted":[],"title_canon_sha256":"2e13b7b79b9f961892108443d6fee8f1e9bb515955ae23293a13615b20f27ae6","abstract_canon_sha256":"bd36c59e5f94c0ddfff84ac374f5b5a4b9d77335e32c4bb1598c449d2a0797ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:10.287327Z","signature_b64":"mhyHTRnDBz7c/fEnvMfCRYSuYVx+2MrJPU8NNQAYqlHMKZJfXwo0w0ZH8dixLxIwMGtNYuQmvjycryTqafMnCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa0dc350fe8a07e200891f91867865ee9979bd9082a6431de348490511934d00","last_reissued_at":"2026-05-18T03:11:10.286593Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:10.286593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphs with the Fewest Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A.J. Radcliffe, L. Keough","submitted_at":"2013-10-07T18:24:22Z","abstract_excerpt":"In recent years there has been increased interest in extremal problems for \"counting\" parameters of graphs. For example, the Kahn-Zhao theorem gives an upper bound on the number of independent sets in a $d$-regular graph. In the same spirit, the Upper Matching Conjecture claims an upper bound on the number of $k$-matchings in a $d$-regular graph. Here we consider both matchings and matchings of fixed sizes in graphs with a given number vertices and edges. We prove that the graph with the fewest matchings is either the lex or the colex graph. Similarly, for fixed $k$, the graph with the fewest "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1879","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":"1310.1879","created_at":"2026-05-18T03:11:10.286715+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.1879v1","created_at":"2026-05-18T03:11:10.286715+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1879","created_at":"2026-05-18T03:11:10.286715+00:00"},{"alias_kind":"pith_short_12","alias_value":"VIG4GUH6RID6","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VIG4GUH6RID6EAEJ","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VIG4GUH6","created_at":"2026-05-18T12:28:04.890932+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/VIG4GUH6RID6EAEJD6IYM6DF52","json":"https://pith.science/pith/VIG4GUH6RID6EAEJD6IYM6DF52.json","graph_json":"https://pith.science/api/pith-number/VIG4GUH6RID6EAEJD6IYM6DF52/graph.json","events_json":"https://pith.science/api/pith-number/VIG4GUH6RID6EAEJD6IYM6DF52/events.json","paper":"https://pith.science/paper/VIG4GUH6"},"agent_actions":{"view_html":"https://pith.science/pith/VIG4GUH6RID6EAEJD6IYM6DF52","download_json":"https://pith.science/pith/VIG4GUH6RID6EAEJD6IYM6DF52.json","view_paper":"https://pith.science/paper/VIG4GUH6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.1879&json=true","fetch_graph":"https://pith.science/api/pith-number/VIG4GUH6RID6EAEJD6IYM6DF52/graph.json","fetch_events":"https://pith.science/api/pith-number/VIG4GUH6RID6EAEJD6IYM6DF52/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VIG4GUH6RID6EAEJD6IYM6DF52/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VIG4GUH6RID6EAEJD6IYM6DF52/action/storage_attestation","attest_author":"https://pith.science/pith/VIG4GUH6RID6EAEJD6IYM6DF52/action/author_attestation","sign_citation":"https://pith.science/pith/VIG4GUH6RID6EAEJD6IYM6DF52/action/citation_signature","submit_replication":"https://pith.science/pith/VIG4GUH6RID6EAEJD6IYM6DF52/action/replication_record"}},"created_at":"2026-05-18T03:11:10.286715+00:00","updated_at":"2026-05-18T03:11:10.286715+00:00"}