TOPICS
Search

Search Results for ""


1321 - 1330 of 13134 for Extremal graph theorySearch Results
The term energy has an important physical meaning in physics and is an extremely useful concept. There are several forms energy defined in mathematics. In measure theory, let ...
A tree to whose nodes and/or edges labels (usually number) are assigned. The word "weight" also has a more specific meaning when applied to trees, namely the weight of a tree ...
A tree spread in which each node has a finite number of children.
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.
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 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 ...
The empire problem, also known as the m-pire problem) asks for the maximum number of colors needed to color countries such that no two countries sharing a common border have ...
Given n matches (i.e., rigid unit line segments), find the number of topologically distinct planar arrangements which can be made (Gardner 1991). In this problem, two matches ...
To color any map on the sphere or the plane requires at most six-colors. This number can easily be reduced to five, and the four-color theorem demonstrates that the necessary ...
A closed trail is called a circuit when it is specified in cyclic order but no first vertex is explicitly identified.
1 ... 130|131|132|133|134|135|136 ... 1314 Previous Next

...