Timeline for n-partite n-clique
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 27, 2011 at 11:17 | vote | accept | Pawan Aurora | ||
| May 26, 2011 at 22:03 | comment | added | fedja | Not really. You said that you do not mind extra edges and you didn't say that the good edge sets must not overlap, so I run full drawing for each vertex. If I get some edges twice, I just consider myself lucky. | |
| May 26, 2011 at 5:24 | comment | added | Pawan Aurora | And yes, each partition must contain at least one non-isolated vertex. The structure of the graph should remain consistent with the condition that each non-isolated vertex $V_{ij}$ has a set of $n-1$ neighbors (one in each of the remaining $n-1$ partitions) that form a permutation with $j$. What it means is that if there is some vertex in a partition that does not get any neighbor from a particular partition when adding edges, then that vertex must be isolated. | |
| May 26, 2011 at 5:24 | comment | added | Pawan Aurora | In your analysis, do you account for the edges that get added due to the permutations chosen by other vertices? I guess what I am trying to say is that once you have chosen the permutations for the vertices in a partition and added edges, when you are choosing permutations for vertices in the next partition, you only choose from the remaining $(n-2)!$ and so on. | |
| May 25, 2011 at 13:43 | history | answered | fedja | CC BY-SA 3.0 |