Search Results for ""

Edge splitting is the reverse of edge contraction.

An elegant algorithm for constructing an Eulerian cycle (Skiena 1990, p. 193).

The problem of deciding if four colors are sufficient to color any map on a plane or sphere.

As shown by Schur (1916), the Schur number S(n) satisfies S(n)<=R(n)-2 for n=1, 2, ..., where R(n) is a Ramsey number.

The Parts graphs are a set of unit-distance graphs with chromatic number five derived by Jaan Parts in 2019-2020 (Parts 2020a). They provide some of the smallest known ...

The braced square problem asks, given a hinged square composed of four equal rods (indicated by the red lines above), how many more hinged rods must be added in the same ...

One of the Zermelo-Fraenkel axioms, also known as the axiom of regularity (Rubin 1967, Suppes 1972). In the formal language of set theory, it states that x!=emptyset=> exists ...

Go is played on a 19×19 grid, with pieces being placed at the intersections of grid lines, rather than in the middle of them. Go boards have a number of peculiarities, ...

A 4-state two-dimensional Turing machine invented in the 1980s. The ant starts out on a grid containing black and white cells, and then follows the following set of rules. 1. ...

The terms "measure," "measurable," etc. have very precise technical definitions (usually involving sigma-algebras) that can make them appear difficult to understand. However, ...