Search Results for ""

Let F_n be the nth Fibonacci number. Then the sequence {F_n}_(n=2)^infty={1,2,3,5,8,...} is complete, even if one is restricted to subsequences in which no two consecutive ...

Let E and F be paired spaces with S a family of absolutely convex bounded sets of F such that the sets of S generate F and, if B_1,B_2 in S, then there exists a B_3 in S such ...

The Hajós number h(G) of a graph G is the maximum k such that G contains a subdivision of the complete graph K_k.

If two pairs of opposite polygon vertices of a complete quadrilateral are pairs of harmonic conjugate points, then the third pair of opposite polygon vertices is likewise a ...

Given a complete graph K_n which is two-colored, the number of forced monochromatic triangles is at least {1/3u(u-1)(u-2) for n=2u; 2/3u(u-1)(4u+1) for n=4u+1; ...

A conic section on which the midpoints of the sides of any complete quadrangle lie. The three diagonal points P, Q, and R also lie on this conic.

The coloring red of two complete subgraphs of n/2 points (for even n) in order to generate a blue-empty graph.

If a fixed point is added to each group of a special complete series, then the resulting series is complete.

A manifold possessing a metric tensor. For a complete Riemannian manifold, the metric d(x,y) is defined as the length of the shortest curve (geodesic) between x and y. Every ...

A Turán graph, sometimes called a maximally saturated graph (Zykov 1952, Chao and Novacky 1982), with positive integer parameters n and k is a type of extremal graph on n ...