Search Results for ""

A graph is claw-free iff it does not contain the complete bipartite graph K_(1,3) (known as the "claw graph"; illustrated above) as a forbidden induced subgraph. The line ...

The absence of contradiction (i.e., the ability to prove that a statement and its negative are both true) in an Axiomatic system is known as consistency.

A functor F is called contravariant if it reverses the directions of arrows, i.e., every arrow f:A-->B is mapped to an arrow F(f):F(B)-->F(A).

For any two integers a and b, suppose d|ab. Then if d is relatively prime to a, then d divides b. This results appeared in Euclid's Elements, Book VII, Proposition 30. This ...

The exponential sum function e_n(x), sometimes also denoted exp_n(x), is defined by e_n(x) = sum_(k=0)^(n)(x^k)/(k!) (1) = (e^xGamma(n+1,x))/(Gamma(n+1)), (2) where ...

A full angle, also called a complete angle, round angle, or perigon, is an angle equal to 2pi radians =360 degrees corresponding to the central angle of an entire circle. ...

Two geometric figures are said to exhibit geometric congruence (or "be geometrically congruent") iff one can be transformed into the other by an isometry (Coxeter and ...

The dual of the great truncated cuboctahedron U_(20) and Wenninger dual W_(93).

A Hamilton decomposition (also called a Hamiltonian decomposition; Bosák 1990, p. 123) of a Hamiltonian regular graph is a partition of its edge set into Hamiltonian cycles. ...

Let K be an algebraically closed field and let I be an ideal in K(x), where x=(x_1,x_2,...,x_n) is a finite set of indeterminates. Let p in K(x) be such that for any ...