Search Results for ""

An n-route is defined as a walk of length n with specified initial point in which no line succeeds itself.

Discrete Mathematics

The resolution principle, due to Robinson (1965), is a method of theorem proving that proceeds by constructing refutation proofs, i.e., proofs by contradiction. This method ...

The pentatope is the simplest regular figure in four dimensions, representing the four-dimensional analog of the solid tetrahedron. It is also called the 5-cell, since it ...

Araya and Wiener (2011) found the two cubic planar hypohamiltonian graphs on 70 and 88 vertices, respectively, illustrated above.

The set of all centroid points in a weighted tree (Harary 1994, p. 36).

Given a pick-7 lottery with 23 numbers that pays a prize to anyone matching at least 4 of the 7 numbers, there is a set of 253 tickets that guarantees a win. This set ...

Let X be an alphabet (i.e., a finite and nonempty set), and call its member letters. A word on X is a finite sequence of letters a_1...a_n, where a_1,...,a_n in X. Denote the ...

The axiom of Zermelo-Fraenkel set theory which asserts the existence of a set containing all the natural numbers, exists x(emptyset in x ^ forall y in x(y^' in x)), where ...

Let A and B be any sets with empty intersection, and let |X| denote the cardinal number of a set X. Then |A|+|B|=|A union B| (Ciesielski 1997, p. 68; Dauben 1990, p. 173; ...