Search Results for ""
1531 - 1540 of 2690 for Heawood Four Color GraphSearch Results
A lattice L is said to be oriented if there exists a rule which assigns a specified direction to any edge connecting arbitrary lattice points x_i,x_j in L. In that way, an ...
A C^infty function is a function that is differentiable for all degrees of differentiation. For instance, f(x)=e^(2x) (left figure above) is C^infty because its nth ...
A group generated by the elements P_i for i=1, ..., n subject to (P_iP_j)^(M_(ij))=1, where M_(ij) are the elements of a Coxeter matrix. Coxeter used the notation [3^(p,q,r)] ...
A 15_3 configuration of 15 lines and 15 points, with three lines through three points, three points on every line, and containing no triangles. It is illustrated above in two ...
A number of attractive 12-compounds of the regular tetrahedron can be constructed. The compounds illustrated above will be implemented in a future version of the Wolfram ...
A web diagram, also called a cobweb plot, is a graph that can be used to visualize successive iterations of a function y=f(x). In particular, the segments of the diagram ...
The Steiner tree of some subset of the vertices of a graph G is a minimum-weight connected subgraph of G that includes all the vertices. It is always a tree. Steiner trees ...
The cross polytope beta_n is the regular polytope in n dimensions corresponding to the convex hull of the points formed by permuting the coordinates (+/-1, 0, 0, ..., 0). A ...
Chess is a two-player board game believed to have been played in India as early as the sixth century AD. In different parts of this world, different chess games are played. ...
Combinatorial geometry is a blending of principles from the areas of combinatorics and geometry. It deals with combinations and arrangements of geometric objects and with ...
...
View search results from all Wolfram sites (28983 matches)

