Search Results for ""

A circulant graph is a graph of n graph vertices in which the ith graph vertex is adjacent to the (i+j)th and (i-j)th graph vertices for each j in a list l. The circulant ...

A surface S is n-embeddable if it can be placed in R^n-space without self-intersections, but cannot be similarly placed in any R^k for k<n. A surface so embedded is said to ...

Let V(G) be the vertex set of a simple graph and E(G) its edge set. Then a graph isomorphism from a simple graph G to a simple graph H is a bijection f:V(G)->V(H) such that ...

Let M be a Riemannian manifold, and let the topological metric on M be defined by letting the distance between two points be the infimum of the lengths of curves joining the ...

Ramsey's theorem is a generalization of Dilworth's lemma which states for each pair of positive integers k and l there exists an integer R(k,l) (known as the Ramsey number) ...

The residue classes of a function f(x) mod n are all possible values of the residue f(x) (mod n). For example, the residue classes of x^2 (mod 6) are {0,1,3,4}, since 0^2=0 ...

A vertex-induced subgraph (sometimes simply called an "induced subgraph") is a subset of the vertices of a graph G together with any edges whose endpoints are both in this ...

When the Gaussian curvature K is everywhere negative, a surface is called anticlastic and is saddle-shaped. A surface on which K is everywhere positive is called synclastic. ...

A vaguely defined branch of mathematics dealing with varieties, the Mordell conjecture, Arakelov theory, and elliptic curves.

An asymptotic direction at a point p of a regular surface M in R^3 is a direction in which the normal curvature of M vanishes. 1. There are no asymptotic directions at an ...