-
507024
Caption: Loops a and b cannot shrink to a point without breaking the loop or the torus, meaning that the torus is not simply connected
Artist: Encyclopaedia Britannica
Release: Not Applicable
File Size: 29.31 MB
-
507118
Caption: The topological concept of a continuous function
Artist: Encyclopaedia Britannica
Release: Not Applicable
File Size: 29.31 MB
-
507012
Caption: After the basic loop, the simplest knot is the trefoil, or overhand, formed with exactly three crossings
Artist: Encyclopaedia Britannica
Release: Not Applicable
File Size: 8.97 MB
-
507054
Caption: (Left) Pieces of a surface given by f(x, y) = 0; (right) if the surface is cut along the curves, an octagon is obtained
Artist: Encyclopaedia Britannica
Release: Not Applicable
File Size: 32.73 MB
-
507138
Caption: In following the circle around the Mobius band, the line L twists, and the lines cannot be made to point in the same direction
Artist: Encyclopaedia Britannica
Release: Not Applicable
File Size: 24.05 MB
-
506584
Caption: Three types of knots used to make handmade carpets
Artist: Encyclopaedia Britannica
Release: Not Applicable
File Size: 38.42 MB
-
506848
Caption: A Sierpinski gasket is made by dividing an equilateral triangle into four, removing the middle one, and repeating the pattern
Artist: Encyclopaedia Britannica
Release: Not Applicable
File Size: 36.54 MB
-
507101
Caption: Table of mathematical knots with zero to seven crossings The number of distinct knots increases with the number of crossings
Artist: Encyclopaedia Britannica
Release: Not Applicable
File Size: 16.34 MB
-
481078
Caption: K5 is not a planar graph, as there is no way to connect every vertex with edges in the plane such that no edges intersect.
Artist: Encyclopaedia Britannica
Release: Not Applicable
File Size: 37.75 MB
-
481148
Caption: Dudeney puzzle (K3,3 bipartite graph): the houses cannot connect to the separate utilities such that no service pipes intersect.
Artist: Encyclopaedia Britannica
Release: Not Applicable
File Size: 33.25 MB
-
481498
Caption: The Konigsberg bridge problem led Leonhard Euler, a Swiss mathematician, to begin the development of graph theory.
Artist: Encyclopaedia Britannica
Release: Not Applicable
File Size: 41.95 MB
-
294487
Caption: Images depicting Network modeling
Artist: ImageZoo
Release: Not Applicable
File Size: 34.62 MB