Search Results for ""

Wagner's theorem states that a graph is planar iff it does not contain K_5 or K_(3,3) as a graph minor.

The proposition that every consistent generalized theory has a model. The theorem is true if the axiom of choice is assumed.

Fubini's theorem, sometimes called Tonelli's theorem, establishes a connection between a multiple integral and a repeated one. If f(x,y) is continuous on the rectangular ...

Every Boolean algebra is isomorphic to the Boolean algebra of sets. The theorem is equivalent to the maximal ideal theorem, which can be proved without using the axiom of ...

Condorcet's jury theorem states that given a group of voters (a "jury") independently choosing by majority vote between a correct outcome with probability 0<=p<=1 and an ...

A theorem in set theory stating that, for all sets A and B, the following equivalences hold, A subset B<=>A intersection B=A<=>A union B=B.

A theorem stated in 1882 which cannot be derived from Euclid's postulates. Given points a, b, c, and d on a line, if it is known that the points are ordered as (a,b,c) and ...

The ABC (atom-bond connectivity) spectral radius rho_(ABC) of a graph is defined as the largest eigenvalue of its ABC matrix. Chen (2019) showed that for a tree on 3 or more ...

Dini's theorem is a result in real analysis relating pointwise convergence of sequences of functions to uniform convergence on a closed interval. For an increasing sequence ...

Iff p is a prime, then (p-1)!+1 is a multiple of p, that is (p-1)!=-1 (mod p). (1) This theorem was proposed by John Wilson and published by Waring (1770), although it was ...