Search Results for ""
1511 - 1520 of 2264 for Vertex transitive graphSearch Results
A theory of Hamiltonian cycles.
Let L be an extension field of K, denoted L/K, and let G be the set of automorphisms of L/K, that is, the set of automorphisms sigma of L such that sigma(x)=x for every x in ...
A group G is said to act on a set X when there is a map phi:G×X->X such that the following conditions hold for all elements x in X. 1. phi(e,x)=x where e is the identity ...
A Ramsey number of the form R(k,k;2).
Edge splitting is the reverse of edge contraction.
An elegant algorithm for constructing an Eulerian cycle (Skiena 1990, p. 193).
The problem of deciding if four colors are sufficient to color any map on a plane or sphere.
As shown by Schur (1916), the Schur number S(n) satisfies S(n)<=R(n)-2 for n=1, 2, ..., where R(n) is a Ramsey number.
The generalized law of sines applies to a simplex in space of any dimension with constant Gaussian curvature. Let us work up to that. Initially in two-dimensional space, we ...
A line segment on the boundary of a face, also called a side.
...
View search results from all Wolfram sites (14104 matches)

