Search Results for ""

The set E of edges of a loopless graph (V,E), being a set of unordered pairs of elements of V, constitutes an adjacency relation on V. Formally, an adjacency relation is any ...

An algorithm for finding a graph's spanning tree of minimum length. It sorts the edges of a graph in order of increasing cost and then repeatedly adds edges that bridge ...

A pseudoforest is an undirected graph in which every connected component contains at most one graph cycle. A pseudotree is therefore a connected pseudoforest and a forest ...

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 ...

Let p be an odd prime and F_n the cyclotomic field of p^(n+1)th roots of unity over the rational field. Now let p^(e(n)) be the power of p which divides the class number h_n ...

A ruled surface is called a generalized cone if it can be parameterized by x(u,v)=p+vy(u), where p is a fixed point which can be regarded as the vertex of the cone. A ...

Let each sphere in a sphere packing expand uniformly until it touches its neighbors on flat faces. Call the resulting polyhedron the local cell. Then the local density is ...

Given a regular pentagon of unit area, mean triangle area of a triangle picked at random inside it is given by the n=5 case of polygon triangle picking, A^_ = ...

A knot equivalent to a polygon in R^3, also called a tame knot. For a polygonal knot K, there exists a plane such that the orthogonal projection pi on it satisfies the ...

The de Grey-Haugstrup graphs are two 6-chromatic graphs on 47 and 48 vertices that are unit-distance in 3 dimensions (de Grey and Haugstrup 2020).