Timeline for A problem about the existence of increasing coloring groups
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 10, 2023 at 17:57 | vote | accept | John Jiang | ||
| Dec 10, 2023 at 17:57 | vote | accept | John Jiang | ||
| Dec 10, 2023 at 17:57 | |||||
| Dec 4, 2023 at 4:36 | answer | added | Fedor Petrov | timeline score: 1 | |
| Dec 2, 2023 at 12:59 | history | edited | John Jiang | CC BY-SA 4.0 |
Correct the original statement which was false
|
| Dec 2, 2023 at 12:56 | comment | added | John Jiang | @FedorPetrov sorry you are absolutely right the original statement was false. I made a correction by removing the condition that each color can contain only one ball of a given label i. Instead I stipulate on the number of distinct labels under each color. | |
| Dec 2, 2023 at 12:54 | history | edited | John Jiang | CC BY-SA 4.0 |
Correct the original statement which was false
|
| Dec 2, 2023 at 10:05 | comment | added | Fedor Petrov | you probably also mean that $a_{n+1}\leqslant k+1$, otherwise the claim does not hold | |
| Dec 2, 2023 at 5:43 | history | asked | John Jiang | CC BY-SA 4.0 |