Search Results for ""
1861 - 1870 of 2690 for Heawood Four Color GraphSearch Results
A hyperbola for which the asymptotes are perpendicular, also called an equilateral hyperbola or right hyperbola. This occurs when the semimajor and semiminor axes are equal. ...
The regular hexagon is the regular polygon with six sides, as illustrated above. The inradius r, circumradius R, sagitta s, and area A of a regular hexagon can be computed ...
A semiperfect magic cube, sometimes also called an "Andrews cube" (Gardner 1976; Gardner 1988, p. 219) is a magic cube for which the cross section diagonals do not sum to the ...
A simple group is a group whose only normal subgroups are the trivial subgroup of order one and the improper subgroup consisting of the entire original group. Simple groups ...
A symmetric polynomial on n variables x_1, ..., x_n (also called a totally symmetric polynomial) is a function that is unchanged by any permutation of its variables. In other ...
The problem of finding the mean triangle area of a triangle with vertices picked inside a triangle with unit area was proposed by Watson (1865) and solved by Sylvester. It ...
The second blackboard problem in the 1997 film Good Will Hunting asks for all the series-reduced trees (referred to by the alternate term "homeomorphically irreducible trees" ...
Consider a network of n resistors R_i so that R_2 may be connected in series or parallel with R_1, R_3 may be connected in series or parallel with the network consisting of ...
An unlabeled transitive digraph with n nodes is called a "topology." The numbers of distinct topologies on n=1, 2, ... nodes are 1, 3, 9, 33, 139, 718, 4535, ... (OEIS ...
A theorem which plays a fundamental role in computer science because it is one of the main tools for showing that certain orderings on trees are well-founded. These orderings ...
...
View search results from all Wolfram sites (28983 matches)

