Search Results for ""

Geometry

The integer sequence 1, 0, 1, 1, 2, 1, 3, 2, 4, 3, 5, 4, 7, 5, 8, 7, 10, 8, 12, 10, 14, 12, 16, 14, 19, 16, 21, 19, ... (OEIS A005044) given by the coefficients of the ...

A magic square for which the number of letters in the word for each number generates another magic square. This definition depends, of course, on the language being used. In ...

R. C. Read defined the anarboricity of a graph G as the maximum number of edge-disjoint nonacyclic (i.e., cyclic) subgraphs of G whose union is G (Harary and Palmer 1973, p. ...

Given a graph G, the arboricity Upsilon(G) is the minimum number of edge-disjoint acyclic subgraphs (i.e., spanning forests) whose union is G. An acyclic graph therefore has ...

A family gamma of nonempty subsets of X whose union contains the given set X (and which contains no duplicated subsets) is called a cover (or covering) of X. For example, ...

The first de Villiers point is the perspector of the reference triangle and its BCI triangle, which is Kimberling center X_(1127) and has triangle center function ...

Given three coins of possibly different sizes which are arranged so that each is tangent to the other two, find the coin which is tangent to the other three coins. The ...

Finch (2010) gives an overview of known results for random Gaussian triangles. Let the vertices of a triangle in n dimensions be normal (normal) variates. The probability ...

The coarseness xi(G) of a graph G is the maximum number of edge-disjoint nonplanar subgraphs contained in a given graph G. The coarseness of a planar graph G is therefore ...