Search Results for ""
1331 - 1340 of 2496 for Simple GraphSearch Results
The problem of deciding if four colors are sufficient to color any map on a plane or sphere.
As shown by Schur (1916), the Schur number S(n) satisfies S(n)<=R(n)-2 for n=1, 2, ..., where R(n) is a Ramsey number.
The word "convergent" has a number of different meanings in mathematics. Most commonly, it is an adjective used to describe a convergent sequence or convergent series, where ...
The Königsberg bridge problem asks if the seven bridges of the city of Königsberg (left figure; Kraitchik 1942), formerly in Germany but now known as Kaliningrad and part of ...
A square which can be dissected into a number of smaller squares with no two equal is called a perfect square dissection (or a squared square). Square dissections in which ...
Suppose that E(G) (the commuting product of all components of G) is simple and G contains a semisimple group involution. Then there is some semisimple group involution x such ...
For a simple continued fraction x=[a_0,a_1,...] with convergents p_n/q_n, the fundamental recurrence relation is given by p_nq_(n-1)-p_(n-1)q_n=(-1)^(n+1).
Interest is a fee (or payment) made for the borrowing (or lending) of money. The two most common types of interest are simple interest, for which interest is paid only on the ...
Simple majority vote is the only procedure which is anonymous, dual, and monotonic.
The nth partial numerator in a generalized continued fraction b_0+K_(n=1)^infty(a_n)/(b_n) is the expression a_n. For a simple continued fraction b_0+K_(n=1)^infty1/(b_n), ...
...
View search results from all Wolfram sites (39665 matches)

