Hi. I was wondering if there is any upperbound to the size of euler walk with respect to number of vertices. If yes then what will be that maximizing condition?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
6 | adamant | 157 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
What is size of euler walk of a tree with n vertices?
Hi. I was wondering if there is any upperbound to the size of euler walk with respect to number of vertices. If yes then what will be that maximizing condition?
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 | venkycodes | 2020-03-29 20:07:12 | 2 | Tiny change: ' condition.' -> ' condition?' | ||
en1 | venkycodes | 2020-03-29 20:05:59 | 213 | Initial revision (published) |
Name |
---|