Please, help me solve this problem:
given nondirectional graph with 6 vertexes
prove that there're 3 connected vertexes in the graph or there're 3 uncconnected vertexes in the graph
sorry for bad english
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3947 |
| 2 | jiangly | 3740 |
| 3 | Radewoosh | 3652 |
| 4 | Benq | 3626 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3612 |
| 7 | ecnerwala | 3587 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | ksun48 | 3485 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | awoo | 163 |
| 2 | maomao90 | 160 |
| 3 | adamant | 156 |
| 4 | atcoder_official | 155 |
| 4 | nor | 155 |
| 6 | cry | 153 |
| 7 | -is-this-fft- | 152 |
| 8 | maroonrk | 151 |
| 9 | SecondThread | 148 |
| 10 | Petr | 146 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Aug/17/2024 16:08:39 (k2).
Desktop version, switch to mobile version.
Supported by
"sorry for bad english" No problem (shake). feel like home