TOPICS
Search

Search Results for ""


1961 - 1970 of 2377 for Goedels Incompleteness TheoremSearch Results
A graph G is Hamilton-connected if every two vertices of G are connected by a Hamiltonian path (Bondy and Murty 1976, p. 61). In other words, a graph is Hamilton-connected if ...
A Heronian triangle is a triangle having rational side lengths and rational area. The triangles are so named because such triangles are related to Heron's formula ...
An incircle is an inscribed circle of a polygon, i.e., a circle that is tangent to each of the polygon's sides. The center I of the incircle is called the incenter, and the ...
The Kepler-Poinsot polyhedra are four regular polyhedra which, unlike the Platonic solids, contain intersecting facial planes. In addition, two of the four Kepler-Poinsot ...
The number of equivalent hyperspheres in n dimensions which can touch an equivalent hypersphere without any intersections, also sometimes called the Newton number, contact ...
The Kneser graphs are a class of graph introduced by Lovász (1978) to prove Kneser's conjecture. Given two positive integers n and k, the Kneser graph K(n,k), often denoted ...
Let X be an arbitrary topological space. Denote the set closure of a subset A of X by A^- and the complement of A by A^'. Then at most 14 different sets can be derived from A ...
Let S(x) denote the number of positive integers not exceeding x which can be expressed as a sum of two squares (i.e., those n<=x such that the sum of squares function ...
The Laplace transform is an integral transform perhaps second only to the Fourier transform in its utility in solving physical problems. The Laplace transform is particularly ...
The term limit comes about relative to a number of topics from several different branches of mathematics. A sequence x_1,x_2,... of elements in a topological space X is said ...
1 ... 194|195|196|197|198|199|200 ... 238 Previous Next

...