10 problems.
- Unicyclic connected graphs and vertex-deleted trees
- Disjoint paths joining two prescribed vertex sets in a k-connected graph
- Every planar graph is 5-colorable
- Matching two equal-block partitions by nonempty intersections
- Tutte’s theorem and 1-factors in cubic bridgeless graphs
- The metric topology of a smaller metric is coarser
- Closed subsets of limit-point compact spaces are limit-point compact
- Borsuk–Ulam theorem for maps \(S^1\to\RR\)
- A strictly finer topology on a compact Hausdorff space is Hausdorff but not compact
- Local connectedness via open components, and preservation under quotient maps