TOPICS
Search

Search Results for ""


121 - 130 of 787 for Map coloringSearch Results
Given a map f:S->T between sets S and T, the map g:T->S is called a right inverse to f provided that f degreesg=id_T, that is, composing f with g from the right gives the ...
An orbifold is the object obtained by identifying any two points of a map which are equivalent under some symmetry of the map's group.
The Hadwiger-Nelson problem asks for the chromatic number of the plane, i.e., the minimum number of colors needed to color the plane if no two points at unit distance one ...
A nonsingular linear map A:R^n->R^n is orientation-reversing if det(A)<0.
A map projection in which the parallels are represented by concentric circular arcs and the meridians by concurrent curves.
A map projection in which the distances between one or two points and every other point on the map differ from the corresponding distances on the sphere by only a constant ...
Given a map f from a space X to a space Y and another map g from a space Z to a space Y, a lift is a map h from X to Z such that gh=f. In other words, a lift of f is a map h ...
The invariance of domain theorem states that if f:M->N is a one-to-one and continuous map between n-manifolds without boundary, then f is an open map.
If K is a finite complex and h:|K|->|K| is a continuous map, then Lambda(h)=sum(-1)^pTr(h_*,H_p(K)/T_p(K)) is the Lefschetz number of the map h.
Every continuous map f:S^n->R^n must identify a pair of antipodal points.
1 ... 10|11|12|13|14|15|16 ... 79 Previous Next

...