Search Results for ""

Let one grain of wheat be placed on the first square of a chessboard, two on the second, four on the third, eight on the fourth, etc. How many grains total are placed on an ...

A complete bipartite graph, sometimes also called a complete bicolored graph (Erdős et al. 1965) or complete bigraph, is a bipartite graph (i.e., a set of graph vertices ...

The Tutte 8-cage (Godsil and Royle 2001, p. 59; right figure) is a cubic graph on 30 nodes and 45 edges which is the Levi graph of the Cremona-Richmond configuration. It ...

An additive category is a category for which the morphism sets have the structure of Abelian groups. It satisfies some, but not all the properties of an Abelian category.

Arrow's paradox, also called Arrow's impossibility theorem or the general possibility theorem, states that perfect democratic voting is impossible, not just in practice but ...

Axiomatic set theory is a version of set theory in which axioms are taken as uninterpreted rather than as formalizations of pre-existing truths.

A logical system which possesses an explicitly stated set of axioms from which theorems can be derived.

The Barnette-Bosák-Lederberg graph is a graph on 38 vertices which is the smallest known example of a planar 3-connected nonhamiltonian graph, i.e., the smallest known ...

A matching is a maximum matching iff it contains no augmenting path.

The m-book graph is defined as the graph Cartesian product B_m=S_(m+1) square P_2, where S_m is a star graph and P_2 is the path graph on two nodes. The generalization of the ...