Problem Forge
Choose at most k vertices so that every edge has at least one chosen end.
This Month's Challenges: Vertex Cover
This month's rungs
| rung | solved, all climbers | answers sent, all climbers | status |
|---|---|---|---|
| 2026-11-VC-12 | 0 | 0 | unsolved |
| 2026-11-VC-11 | 0 | 0 | unsolved |
| 2026-11-VC-10 | 0 | 0 | unsolved |
| 2026-11-VC-09 | 0 | 0 | unsolved |
| 2026-11-VC-08 | 1 | 1 | solved |
| 2026-11-VC-07 | 1 | 1 | solved |
| 2026-11-VC-06 | 1 | 1 | solved |
| 2026-11-VC-05 | 1 | 1 | solved |
| 2026-11-VC-04 | 1 | 1 | solved |
| 2026-11-VC-03 | 1 | 1 | solved |
| 2026-11-VC-02 | 1 | 1 | solved |
| 2026-11-VC-01 | 1 | 1 | solved |
| 2026-11-VC-00 | 1 | 1 | solved |
Sign in to see your own progress and to open the rungs.
Samples
Five sample files, each with its answer. You need no account. To check your own answer, open a file on the Check page.
- SAMPLE-VC-01.col · 556 vertices, 1199 edges · answer
- SAMPLE-VC-02.col · 5917 vertices, 12863 edges · answer
- SAMPLE-VC-03.col · 452 vertices, 949 edges · answer
- SAMPLE-VC-04.col · 477 vertices, 1041 edges · answer
- SAMPLE-VC-05.col · 2649 vertices, 5712 edges · answer
Read more: references for Vertex Cover.