Timeline for For every partition of $E(K_{n,n})$ into $n$ colour classes of size $n$, there is a vertex incident to at least $\sqrt{n}$ colours
Current License: CC BY-SA 4.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 7, 2023 at 8:47 | vote | accept | Marina Drygala | ||
| Feb 3, 2023 at 21:17 | comment | added | Tony Huynh | I took the liberty of editing the question for clarity. | |
| Feb 3, 2023 at 21:14 | history | edited | Tony Huynh | CC BY-SA 4.0 |
added 26 characters in body; edited tags; edited title
|
| Feb 3, 2023 at 21:03 | review | Close votes | |||
| Feb 8, 2023 at 3:08 | |||||
| Feb 3, 2023 at 18:31 | comment | added | Wlod AA | @EmilJeřábek, thank you. Thus "coloring" here seems simply an arbitrary labeling. After an Edit of OP Question, now this labeling is somewhat constrained. | |
| Feb 3, 2023 at 18:05 | answer | added | Tony Huynh | timeline score: 4 | |
| Feb 3, 2023 at 16:19 | comment | added | Emil Jeřábek | @WlodAA Proper edge colouring = edge colouring. Based on the discussion, I assume what the OP means is that we are given a labelling of edges by colours without any constraints on incident edges. | |
| Feb 3, 2023 at 15:48 | comment | added | Marina Drygala | Sorry I had missed an important detail, is it more clear now? | |
| Feb 3, 2023 at 15:46 | history | edited | Marina Drygala | CC BY-SA 4.0 |
added 40 characters in body
|
| Feb 3, 2023 at 15:28 | comment | added | Wlod AA | Would you provide the definition of proper edge coloring (straight in your Question)? -- it'd be so nice. | |
| Feb 3, 2023 at 15:20 | comment | added | Marina Drygala | Its not a proper edge colouring | |
| Feb 3, 2023 at 14:17 | comment | added | Wlod AA | As it's now, this sounds as a misunderstanding. Every vertex of $\ K_{n\,n}\ $ is an end of $\ n\ $ different edges that are of $n$-different colors (by the definition of the edge-coloring). | |
| Feb 3, 2023 at 13:40 | history | asked | Marina Drygala | CC BY-SA 4.0 |