TOPICS
Search

Search Results for ""


1261 - 1270 of 1987 for Robertson graphSearch Results
A special case of the quadratic Diophantine equation having the form x^2-Dy^2=1, (1) where D>0 is a nonsquare natural number (Dickson 2005). The equation x^2-Dy^2=+/-4 (2) ...
A Pythagorean triple is a triple of positive integers a, b, and c such that a right triangle exists with legs a,b and hypotenuse c. By the Pythagorean theorem, this is ...
A closed trail is called a circuit when it is specified in cyclic order but no first vertex is explicitly identified.
A Ramsey number of the form R(k,k;2).
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 ...
1 ... 124|125|126|127|128|129|130 ... 199 Previous Next

...