Timeline for Reference request: $n$-edge-coloring bipartite graph $K_{n,n}$ such that monochromatic parts are isomorphic
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 21, 2019 at 5:53 | comment | added | Lwins | @GerhardPaseman (a a b) (a c c) (b c b) (a a a) (b b b) (c c c) (Write it as a 3x6 matrix and naturally construct a 6x6 one) | |
| Mar 21, 2019 at 5:48 | history | edited | Lwins | CC BY-SA 4.0 |
added 65 characters in body
|
| Mar 21, 2019 at 4:51 | comment | added | Gerhard Paseman | For n=6 and A having the six ones be in the upper left corner (I+j < 3), I would like to see the six arrangements of A adding up to J. Gerhard "Not Sure If It's Possible" Paseman, 2019.03.20. | |
| Mar 21, 2019 at 4:30 | history | edited | Lwins | CC BY-SA 4.0 |
deleted 2 characters in body
|
| S Mar 21, 2019 at 4:30 | history | suggested | user64494 | CC BY-SA 4.0 |
Two typos are corrected.
|
| Mar 20, 2019 at 16:49 | review | Suggested edits | |||
| S Mar 21, 2019 at 4:30 | |||||
| Mar 20, 2019 at 15:51 | review | Suggested edits | |||
| Mar 20, 2019 at 16:14 | |||||
| Mar 20, 2019 at 14:57 | history | asked | Lwins | CC BY-SA 4.0 |