{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:RPISH2GCUGWLVHS6XC3OFP7YZB","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":"19a72225938f8f220a4786608e382c7376a025b15895e1e6dccd3841886b6083","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-30T14:28:12Z","title_canon_sha256":"6ae74b0cd82f5815be8033ca5739a6875acb08f080eb8dd1b9a010de112f1c6b"},"schema_version":"1.0","source":{"id":"1011.6554","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.6554","created_at":"2026-05-18T03:28:54Z"},{"alias_kind":"arxiv_version","alias_value":"1011.6554v1","created_at":"2026-05-18T03:28:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.6554","created_at":"2026-05-18T03:28:54Z"},{"alias_kind":"pith_short_12","alias_value":"RPISH2GCUGWL","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"RPISH2GCUGWLVHS6","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"RPISH2GC","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:fe45d5bd0066da9b650e1b3a278e320825395e5e0716e3374834c0646f9c3257","target":"graph","created_at":"2026-05-18T03:28:54Z","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":"We determine upper and lower bounds for the number of maximum matchings (i.e., matchings of maximum cardinality) $m(T)$ of a tree $T$ of given order. While the trees that attain the lower bound are easily characterised, the trees with largest number of maximum matchings show a very subtle structure. We give a complete characterisation of these trees and derive that the number of maximum matchings in a tree of order $n$ is at most $O(1.391664^n)$ (the precise constant being an algebraic number of degree 14). As a corollary, we improve on a recent result by G\\'orska and Skupie\\'n on the number o","authors_text":"Clemens Heuberger, Stephan Wagner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-30T14:28:12Z","title":"The number of maximum matchings in a tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.6554","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:fa18919daae566589eda609ce5c990042dba11fa3db2af30a900f0f48f0a97b0","target":"record","created_at":"2026-05-18T03:28:54Z","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":"19a72225938f8f220a4786608e382c7376a025b15895e1e6dccd3841886b6083","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-30T14:28:12Z","title_canon_sha256":"6ae74b0cd82f5815be8033ca5739a6875acb08f080eb8dd1b9a010de112f1c6b"},"schema_version":"1.0","source":{"id":"1011.6554","kind":"arxiv","version":1}},"canonical_sha256":"8bd123e8c2a1acba9e5eb8b6e2bff8c8576cbc132bba1b1cdfd6e1dd0f3ea669","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8bd123e8c2a1acba9e5eb8b6e2bff8c8576cbc132bba1b1cdfd6e1dd0f3ea669","first_computed_at":"2026-05-18T03:28:54.364738Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:54.364738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4QHSNJRMNsxpuUL6qe1yyzTVx4kaeyxyKEf/Vnhmq5pH8bBVvZyqntK2wM2kHSsG3Vxu2iazqLVEex517lQoDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:54.365405Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.6554","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa18919daae566589eda609ce5c990042dba11fa3db2af30a900f0f48f0a97b0","sha256:fe45d5bd0066da9b650e1b3a278e320825395e5e0716e3374834c0646f9c3257"],"state_sha256":"42c9f7b945cdec9b247b8fb853fb9753749be73e9be9a34f98d337941c30b9c4"}