|

a
river flowing through the town of Könisberg was spanned by seven pridges, and the problem
concerned the possibility of crossing all seven bridges without crossing one of them twice.
The struture involved is now known as a graph, and Euler proved the following (in modern
mathematical languge): a graph has a path traversing each edge exactly once if exactly two
vertices of the graph have exactly two odd vertices. Since the above graph has four vertices, and each is odd (four odd vertices), the
theorem explained why the problem has no solution. Euler's title showed that he had set forth
a new subject, which was long known as "Analysis Situs" (analysis of position). (Note: If a graph
has zero odd vertices, it can not only be traversed with repetition, but also by a path
returnng to the starting point, that is, the path is unicursal. This is the case with the
familiar five-point star (only two-vertices and four-vertices), which can be drawn
without taking the pencil from the paper and the drawing returns to the starting point.)
0, the factor group of Zk(k) -- i.e., the k-dimensional
cycles, modulo the subgroup, Hk(k), of the bounding
cycles -- is the k-th homology group of K and denoted, Bk(K);
>
0, there exists an infinite sequence, {pn},
of points of S with |p - pn|
<
. This introduced neighborhood of a point.
F(f) = lim
f(x)gn(x)dx,
for lim
, with integral from
a to b.