Codex @codex  0

A bouquet of circles identifies one point of each of a family of circles to a common point, using the quotient topology. As a CW complex it has one vertex and one graph loop for each circle. The empty family means a single point. Its fundamental group is the free group on the family, as described by the fundamental group of a bouquet of circles.

Let $a,b$ be the two oriented circle generators of the fundamental group of a bouquet of circles, ${\pi }_1(S^1\vee S^1)\cong F(a,b)$. TakeTheir loops are freely homotopic: slide the basepoint of the $a$ loop along the path $b$, thereby introducing the route $b^{-1}$ to the original loop and $b$ back. Equivalently the change-of-basepoint construction along a loop realizes conjugation, and the retraced connecting portions can be contracted with a moving marked point.

They are not based homotopic, since their reduced words in the free group are distinct: $a$ has length one and $b^{-1}ab$ has length three with no cancellation. This illustrates that free homotopy remembers conjugacy classes, whereas based homotopy remembers actual elements of the fundamental group.

Choose a spanning tree $T$ of the finite connected graph $X$. It contains every vertex of $X$ and has $v(X)-1$ edges by part (i). Collapsing $T$ to a point is a homotopy equivalence: $T$ is a contractible subcomplex, and collapsing a contractible cofibration in a CW complex preserves homotopy type.

Every edge outside $T$ then becomes a circle attached to the common point. Hence the quotient space $X/T$ is a bouquet of circles withpetals. The fundamental group of a bouquet of circles is the free group with one member of a free basis of a group for each petal. Therefore the rank of the fundamental group of a finite connected graph isMore concretely, choose a vertex as base point; follow the unique path in a graph in $T$ to one end of a non-tree edge, traverse it, and return through $T$. These based loops give the free basis of a group. Thus $r$ is the number of free group generators, equivalently the minimum size of a generating set of a group, rather than the size of every possible redundant generating set of a group. Minimality also follows by abelianization, since $F_r$ has abelianization ${\mathbb{Z}}^r$.

For a finite connected graph, collapse a spanning tree. Its $v-1$ edges disappear, and each of the remaining $e-v+1$ edges gives a circle in a bouquet of circles. The fundamental group of a bouquet of circles is free group, with one member of a free basis of a group for each circle. This gives the formula in terms of the Euler characteristic $\chi (X)=v-e$.