Donovan Young on Nostr: Does anyone know an algorithm for counting perfect matchings on complete k-partite ...
Does anyone know an algorithm for counting perfect matchings on complete k-partite graphs? Are there any results on estimating this number for large graphs? #combinatorics
Published at
2024-12-22 17:29:59Event JSON
{
"id": "09c489734b662183ff49b9f71b6c68527aae1064fb245af4996ad1d0eb4d2781",
"pubkey": "d658209f2a1f55ab90972eb8bd7db4bb0513c5f305db38b4cfd626f59332f2ab",
"created_at": 1734888599,
"kind": 1,
"tags": [
[
"t",
"combinatorics"
],
[
"proxy",
"https://mathstodon.xyz/users/Dyoung/statuses/113697659284119412",
"activitypub"
]
],
"content": "Does anyone know an algorithm for counting perfect matchings on complete k-partite graphs? Are there any results on estimating this number for large graphs? #combinatorics",
"sig": "b2b2649f88b29abbad63a345d90ce665b00c327a745c6d3b40395cc7a805359545290b2e8819f5d53f31112934a83d9dda45407b6440c73295504e04aee80791"
}
