Timeline for Generating sets of tuples from possible candidate lists (or finding perfect matchings in uniform hypergraphs)
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 18, 2011 at 17:35 | vote | accept | user14473 | ||
| Apr 18, 2011 at 13:25 | history | edited | Aaron Meyerowitz | CC BY-SA 3.0 |
added 826 characters in body
|
| Apr 18, 2011 at 5:36 | vote | accept | user14473 | ||
| Apr 18, 2011 at 5:38 | |||||
| Apr 18, 2011 at 5:09 | comment | added | user14473 | Great edit. I was about to post essentially the same idea. To connect it to the comment by Gerry Myerson, each $T$-matching is a system of distinct representatives of $S_1,\ldots,S_T$, so I'm looking for $k$ disjoint SDRs. I'm not sure that this is any easier than finding matchings in the hypergraphs, but it seems to be non-trivial to build the hypergraph for $T > 2$ - each maximum matching of the bipartite graph is a hyperedge of the hypergraph you described. | |
| Apr 18, 2011 at 4:36 | history | edited | Aaron Meyerowitz | CC BY-SA 3.0 |
another idea
|
| Apr 18, 2011 at 4:14 | history | answered | Aaron Meyerowitz | CC BY-SA 3.0 |