Timeline for The edge precoloring extension problem for complete graphs
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 25, 2020 at 11:06 | comment | added | Florian Lehner | I have no idea whether it is or isn't possible for your specific precolouring, all I'm saying is that my examples don't fit your pattern. | |
| Jul 25, 2020 at 9:23 | comment | added | vidyarthi | why do you think the extension is possible for the kind of coloring I give? | |
| Jul 24, 2020 at 15:47 | comment | added | Florian Lehner | Since you have updated the question and are now asking about one specific precolouring, this answer does not fit the question anymore. The pre-colouring I had in mind for the second part was $1,2,\dots,k$ in the first row, $1,2,\dots, k-1$ in the second row, $1,2,\dots, k-2$ in the third row etc. If this can be extended to a full colouring (which I think should be possible), then there is more than one way to do it (e.g. swap the roles of $k+1$ and $k+2$). | |
| Jul 24, 2020 at 11:53 | comment | added | vidyarthi | I didnt quite get your last paragraph. You meant we can have at most $k$ in a single row? And then what is the permutation you are talking about? In the case $n=8$, as shown in the answer by Moritz, it is unique it seems | |
| Jul 24, 2020 at 10:47 | history | answered | Florian Lehner | CC BY-SA 4.0 |