TOPICS
Search

Search Results for ""


1251 - 1260 of 1968 for Circulant GraphSearch Results
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 ...
The first Brocard point is the interior point Omega (also denoted tau_1 or Z_1) of a triangle DeltaABC with points labeled in counterclockwise order for which the angles ...
Determinants are mathematical objects that are very useful in the analysis and solution of systems of linear equations. As shown by Cramer's rule, a nonhomogeneous system of ...
A matrix is a concise and useful way of uniquely representing and working with linear transformations. In particular, every linear transformation can be represented by a ...
The Königsberg bridge problem asks if the seven bridges of the city of Königsberg (left figure; Kraitchik 1942), formerly in Germany but now known as Kaliningrad and part of ...
The bound for the number of colors which are sufficient for map coloring on a surface of genus g, gamma(g)=|_1/2(7+sqrt(48g+1))_| is the best possible, where |_x_| is the ...
Given a map with genus g>0, Heawood showed in 1890 that the maximum number N_u of colors necessary to color a map (the chromatic number) on an unbounded surface is N_u = ...
The number of colors sufficient for map coloring on a surface of genus g is given by the Heawood conjecture, chi(g)=|_1/2(7+sqrt(48g+1))_|, where |_x_| is the floor function. ...
The Earth-Moon problem is a special case of the empire problem for countries with m=2 disjoint regions, with one region of each country lying on the Earth and one on the Moon ...
A generalization of Turán's theorem to non-complete graphs.
1 ... 123|124|125|126|127|128|129 ... 197 Previous Next

...