Graphs and Two-Complexes

due by Monday, Dec 14, 2020
  1. An edge path of length between distinct vertices $p$ and $q$ of a graph $\Gamma$ is said to be minimal if every edge path between $p$ and $q$ in has length at least k. Prove or disprove the following.

    • (a) Every minimal path is reduced.
    • (b) Every reduced path is minimal.
  2. Let $\Gamma$ be a graph that contains no (non-constant) reduced loops. Prove or disprove that its geometric realization $|\Gamma|$ is homotopy equivalent to a discrete topological space.

  3. Let $X$ be a topological space obtained by attaching a finite number of $1$-cells to a torus. Prove or disprove the following.

    • (a) $X$ must be path-connected.
    • (b) $X$ must be simply-connected.
    • (c) $X$ cannot be simply-connected.
  4. Let $X$ be the topological space obtained byattaching two 2-cells to the circle, with the attaching maps $z\mapsto z^2$ and $z\mapsto z^3$, respectively. Determine the fundamental group of $X$.