9 problems.
- A label-preserving forest in the symmetric-difference graph of a set family
- Pair leaves by edge-disjoint paths and find edge-disjoint cycles through a vertex
- Bound a graph’s chromatic number using two consecutive distance layers
- A tree has a perfect matching exactly when each vertex deletion has one odd component
- A Ramsey theorem for empty, complete, or monotone induced digraphs
- Disjoint open sets in an extremally disconnected space have disjoint closures
- A connected locally path-connected space is path-connected
- If \(f\) is a compact-to-Hausdorff continuous surjection and \(g\circ f\) is continuous, then \(g\) is continuous
- The product of two locally compact spaces is locally compact