Timeline for Number of edge-invariant walks in complete graph
Current License: CC BY-SA 4.0
25 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 11, 2019 at 10:22 | answer | added | Jiro | timeline score: 0 | |
| Apr 10, 2019 at 22:07 | answer | added | Max Alekseyev | timeline score: 1 | |
| Apr 10, 2019 at 22:06 | comment | added | Gerry Myerson | 12 versions in eight hours. Holy cow. | |
| Apr 10, 2019 at 21:51 | history | edited | Jiro | CC BY-SA 4.0 |
more precise permutation
|
| Apr 10, 2019 at 21:42 | comment | added | Jiro | @MaxAlekseyev You're right, I'll be more precise. | |
| Apr 10, 2019 at 21:29 | history | edited | Jiro | CC BY-SA 4.0 |
add permutation
|
| Apr 10, 2019 at 21:28 | comment | added | Jiro | @MaxAlekseyev Thank you very much for pointing this our. The walks should be permutations of each other. I must have dropped this accidentally in an edit. I will correct. | |
| Apr 10, 2019 at 20:57 | history | edited | Jiro | CC BY-SA 4.0 |
index shift
|
| Apr 10, 2019 at 20:55 | comment | added | Jiro | @MaxAlekseyev Sorry, the index was shifted by one. I correct this. Further, there are 4 walks, [1,1], [1,2], [2,1], [2,2] as order matters. | |
| Apr 10, 2019 at 16:58 | history | edited | Jiro | CC BY-SA 4.0 |
clean up
|
| Apr 10, 2019 at 16:50 | history | edited | Jiro | CC BY-SA 4.0 |
clean up
|
| Apr 10, 2019 at 16:42 | history | edited | Max Alekseyev |
edited tags
|
|
| Apr 10, 2019 at 16:06 | history | edited | Jiro | CC BY-SA 4.0 |
add n equal to 3
|
| Apr 10, 2019 at 15:47 | comment | added | Jiro | @SamHopkins I think, it should be $e_p \neq e_q$. The set P should have a representative from each equivalent class formed by the edge-invariance. | |
| Apr 10, 2019 at 15:44 | comment | added | Sam Hopkins | Do you want $e_p=e_q$ or $e_p\neq e_q$? | |
| Apr 10, 2019 at 15:31 | comment | added | Jiro | @MaxAlekseyev Thanks for the clarification. $e_p$ are multisets. | |
| Apr 10, 2019 at 15:30 | history | edited | Jiro | CC BY-SA 4.0 |
change multiset
|
| Apr 10, 2019 at 15:27 | comment | added | Jiro | @MaxAlekseyev In fact, it's even walks | |
| Apr 10, 2019 at 15:20 | comment | added | Jiro | @MaxAlekseyev oh yes, I'm sorry, it should be trails not paths. I will correct this | |
| Apr 10, 2019 at 14:59 | history | edited | Jiro | CC BY-SA 4.0 |
clarify edge invariant
|
| Apr 10, 2019 at 14:55 | comment | added | Jiro | @FedorPetrov Sorry, I meant simply a complete graph (with edges from each vertices to any other) and not a tournament. I also clarified the edge-invariant property. | |
| Apr 10, 2019 at 14:53 | history | edited | Jiro | CC BY-SA 4.0 |
deleted 9 characters in body
|
| Apr 10, 2019 at 14:30 | comment | added | Fedor Petrov | What do you mean by complete directed graph? Tournament? Next, what is "edge invariant" - a binary relation on pairs? Then what does "how many edge-invariant paths" mean? | |
| Apr 10, 2019 at 14:05 | history | edited | Jiro | CC BY-SA 4.0 |
typo
|
| Apr 10, 2019 at 14:00 | history | asked | Jiro | CC BY-SA 4.0 |