Timeline for What is this invariant graph?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 22, 2021 at 14:53 | vote | accept | Ben Tom | ||
| Jul 16, 2021 at 22:36 | comment | added | Peter Taylor | @bof, good point. | |
| Jul 16, 2021 at 22:35 | history | edited | Peter Taylor | CC BY-SA 4.0 |
deleted 207 characters in body
|
| Jul 16, 2021 at 8:44 | comment | added | bof | Doesn't your argument for even $n$ show that $\varepsilon_n(\mathbb Z_G)=1+\binom n2+\frac{n-2}2=\frac{n^2}2$ in that case? By adding $\frac{n-2}2$ new edges to $K_n$ you get a (multi-)graph with only two vertices of odd degree, so it has an Eulerian trail. | |
| Jul 12, 2021 at 23:31 | comment | added | bof | In other words, $\varepsilon_n(G)$ is the minimum order of an induced subgraph of $G$ whose achromatic number is $n$, with the weird stipulation that $\varepsilon_n(G)=0$ if there is no such subgraph. | |
| Jul 12, 2021 at 22:17 | history | answered | Peter Taylor | CC BY-SA 4.0 |