Timeline for What is this invariant graph?
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 22, 2021 at 14:53 | vote | accept | Ben Tom | ||
| Jul 13, 2021 at 6:45 | comment | added | Ben Tom | @bof, strange, but this is the first time I hear about the achromatic number and it definitely has relationship of my question. | |
| Jul 12, 2021 at 23:37 | comment | added | bof | Have you noticed the relationship of your question to the concept of the achromatic number of a graph? | |
| Jul 12, 2021 at 23:26 | comment | added | Ben Tom | @bof, yes, $v(G)$ is a number of vertices. It seemed to me that $\varepsilon_n(G)= 0$ would be correct if there are no required colorings . I guess I want to keep the boundaries $0\leq \varepsilon_n(G)\leq v(G) $ Maybe I was wrong. | |
| Jul 12, 2021 at 22:52 | comment | added | bof | By $v(G)$ do you mean $n(G)$, the number of vertices? When $n\gt m$ why isn't $\varepsilon_n(K_m)$ undefined or $\infty$?> | |
| Jul 12, 2021 at 22:17 | answer | added | Peter Taylor | timeline score: 2 | |
| Jul 12, 2021 at 21:46 | comment | added | LSpice | I don't think "$\varepsilon_n(G) \in \mathrm{FNP}$" literally makes sense, but perhaps this sort of shorthand for "the problem of computing $\varepsilon_n(G)$ belongs to $\mathrm{FNP}$" is common. | |
| Jul 12, 2021 at 21:45 | history | edited | LSpice | CC BY-SA 4.0 |
Minor TeXing
|
| S Jul 12, 2021 at 21:34 | history | suggested | Dirk Werner | CC BY-SA 4.0 |
TeX ing and grammar
|
| Jul 12, 2021 at 21:18 | review | Suggested edits | |||
| S Jul 12, 2021 at 21:34 | |||||
| Jul 12, 2021 at 21:07 | review | First posts | |||
| Jul 12, 2021 at 21:18 | |||||
| Jul 12, 2021 at 20:59 | history | asked | Ben Tom | CC BY-SA 4.0 |