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?
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Kevin114514 | 3655 |
| 3 | Benq | 3650 |
| 4 | maroonrk | 3427 |
| 5 | strapple | 3413 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | tourist | 3301 |
| 9 | turmax | 3297 |
| 10 | squareOf105 | 3262 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | maspy | 150 |
| 2 | nik_exists | 150 |
| 4 | Um_nik | 144 |
| 5 | Errichto | 139 |
| 6 | adamant | 136 |
| 7 | AmShZ | 134 |
| 8 | maroonrk | 133 |
| 8 | BledDest | 133 |
| 10 | Dominater069 | 129 |
→ Find user
→ Recent actions
What is size of euler walk of a tree with n vertices?
Revision en2, by venkycodes, 2020-03-29 20:07:12
History
Revisions
| 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) |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Sep/16/2026 07:23:35 (f1).
Desktop version, switch to mobile version.
Supported by
