Timeline for Can one make Erdős's Ramsey lower bound explicit?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 1 at 12:08 | history | undeleted | CHUAKS | ||
| Oct 3, 2023 at 21:17 | history | deleted | CHUAKS | via Vote | |
| Jun 6, 2023 at 6:07 | comment | added | Brendan McKay | As you can see from the other answers, the meaning of "explicit construction" has room for discussion. It usually means instructions for making a particular example, but the time required to carry out the constructions is important. Consider "try all the graphs on $n$ vertices until finding one that works". It is completely explicit and can be programmed, but nobody would consider it an answer to the question. | |
| May 31, 2023 at 14:28 | comment | added | Brendan McKay | I don't think this answers the question. An algorithm does not count as a "constructive solution" in this context. The OP wants a description of the solution, not a program for finding the solution. | |
| May 31, 2023 at 2:24 | history | answered | CHUAKS | CC BY-SA 4.0 |