Donovan Young on Nostr: Hence comes my main question. Assuming the \(k_i \simeq {\cal O}(n)\), where we take ...
Hence comes my main question. Assuming the \(k_i \simeq {\cal O}(n)\), where we take \(n\to\infty\), where in the two-parameter space of configurations, is the number of perfect matchings a maximum?
Well, for the 4-partite case, I think I know the answer, but things quickly escalate for higher \(k\).
So I would like to know what can be said in general for fixed, but large sets of vertices \(k_i\).
Published at
2024-12-30 18:33:22Event JSON
{
"id": "c9c40a1265889b2a072d1b5ec0f02e79fff79c6192df212a8ba2bc9fe46bdb50",
"pubkey": "d658209f2a1f55ab90972eb8bd7db4bb0513c5f305db38b4cfd626f59332f2ab",
"created_at": 1735583602,
"kind": 1,
"tags": [
[
"e",
"83739c0f256761bf13941a426a0678fffc6eb0200ca38c4c19a7970b96970232",
"wss://relay.mostr.pub",
"reply"
],
[
"proxy",
"https://mathstodon.xyz/users/Dyoung/statuses/113743206959636092",
"activitypub"
]
],
"content": "Hence comes my main question. Assuming the \\(k_i \\simeq {\\cal O}(n)\\), where we take \\(n\\to\\infty\\), where in the two-parameter space of configurations, is the number of perfect matchings a maximum?\n\nWell, for the 4-partite case, I think I know the answer, but things quickly escalate for higher \\(k\\).\n\nSo I would like to know what can be said in general for fixed, but large sets of vertices \\(k_i\\).",
"sig": "1dd3be7e152fd31e9764af8bd9c4b601dd0e2dfdf5b6c9a5ba9eaa3acc0a749ee144b9fa160d972ddc1f8aa5ac7338e0da0130c025b24147287c27d85f604f72"
}
