TOPICS
Search

Search Results for ""


1281 - 1290 of 2006 for Graph entropySearch Results
A relation R on a set S is transitive provided that for all x, y and z in S such that xRy and yRz, we also have xRz.
The 600-cell is the finite regular four-dimensional polytope with Schläfli symbol {3,3,5}. It is also known as the hypericosahedron or hexacosichoron. It is composed of 600 ...
In its original form, the Poincaré conjecture states that every simply connected closed three-manifold is homeomorphic to the three-sphere (in a topologist's sense) S^3, ...
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 ...
1 ... 126|127|128|129|130|131|132 ... 201 Previous Next

...