In graph theory, Mac Lane's planarity criterion is a characterisation of planar graphs in terms of their cycle spaces, named after Saunders Mac Lane, who published it in 1937. It states that a finite undirected graph is planar if and only if the cycle space of the graph (taken modulo 2) has a cycle basis in which each edge of the graph participates in at most two basis vectors. Statement For any cycle in a graph , one can form an -dimensional 0-1 vector that has a 1 in the coordinate positions corresponding to edges in and a 0 in the remaining coordinate positions. The cycle space of the graph is the vector space formed by all possible linear combinations of vectors formed in this way. In Mac Lane's characterization, is a vector space over the finite field with two elements; that is, in this vector space, vectors are added coordinatewise modulo two. A 2-basis of is a basis of with the property that, for each edge in , at most two basis vectors have nonzero coordinates in the position corresponding to . Then, stated more formally, Mac Lane's characterization is that the planar graphs are exactly the graphs that have a 2-basis. Existence of a 2-basis for planar graphs One direction of the characterisation states that every planar graph has a 2-basis. Such a basis may be found as the collection of boundaries of the bounded faces of a planar embedding of the given graph . If an edge is a bridge of , it appears twice on a single face boundary and therefore has a zero coordinate in the corresponding vector. Thus, the only edges that have nonzero coordinates are the ones that separate two different faces; these edges appear either once (if one of the faces is the unbounded one) or twice in the collection of boundaries of bounded faces. It remains to prove that these cycles form a basis. One way to prove this by induction. As a base case, is a tree, then it has no bounded faces and is zero-dimensional and has an empty basis. Otherwise, removing an edge from the unbounded face of reduces both the dimension of the cycle space and the number of bounded faces by one and the induction follows. Alternatively, it is possible to use Euler's formula to show that the number of cycles in this collection equals the