Search Results for ""
2231 - 2240 of 13134 for Extremal graph theorySearch Results
The negative integers ..., -3, -2, -1.
The positive integers 1, 2, 3, ..., equivalent to N.
The nonnegative integers 0, 1, 2, ....
If r is a root of a nonzero polynomial equation a_nx^n+a_(n-1)x^(n-1)+...+a_1x+a_0=0, (1) where the a_is are integers (or equivalently, rational numbers) and r satisfies no ...
The Zermelo-Fraenkel axioms are the basis for Zermelo-Fraenkel set theory. In the following (Jech 1997, p. 1), exists stands for exists, forall means for all, in stands for ...
The trefoil knot 3_1, also called the threefoil knot or overhand knot, is the unique prime knot with three crossings. It is a (3, 2)-torus knot and has braid word sigma_1^3. ...
A k-automatic set is a set of integers whose base-k representations form a regular language, i.e., a language accepted by a finite automaton or state machine. If bases a and ...
One of the Zermelo-Fraenkel axioms which asserts the existence for any set a of the power set x consisting of all the subsets of a. The axiom may be stated symbolically as ...
The term Borel hierarchy is used to describe a collection of subsets of R defined inductively as follows: Level one consists of all open and closed subsets of R, and upon ...
The finite simple groups of Lie-type. They include four families of linear simple groups: PSL(n,q) (the projective special linear group), PSU(n,q) (the projective special ...
...
View search results from all Wolfram sites (34319 matches)

