Search Results for ""
1321 - 1330 of 2690 for Heawood Four Color GraphSearch Results
A formal extension of the hypergeometric function to two variables, resulting in four kinds of functions (Appell 1925; Picard 1880ab, 1881; Goursat 1882; Whittaker and Watson ...
The Dyson mod 27 identities are a set of four Rogers-Ramanujan-like identities given by A(q) = 1+sum_(n=1)^(infty)(q^(n^2)(q^3;q^3)_(n-1))/((q;q)_n(q;q)_(2n-1)) (1) = ...
Sphere tetrahedron picking is the selection of quadruples of of points corresponding to vertices of a tetrahedron with vertices on the surface of a sphere. n random ...
A schematic diagram used in logic theory to depict collections of sets and represent their relationships. The Venn diagrams on two and three sets are illustrated above. The ...
A clique covering of a graph G is set of cliques such that every vertex of G is a member of at least one clique. A minimum clique covering is a clique covering of minimum ...
A fractional clique of a graph G is a nonnegative real function on the vertices of G such that sum of the values on the vertices of any independent set is at most one. The ...
An induced subgraph is a subgraph obtained from an original graph by removing a subset of vertices and/or edges together with any edges whose endpoints are both in this ...
The vertical line test is a graphical method of determining whether a curve in the plane represents the graph of a function by visually examining the number of intersections ...
A 24-dimensional Euclidean lattice. An automorphism of the Leech lattice modulo a center of two leads to the Conway group Co_1. Stabilization of the one- and two-dimensional ...
The Császár polyhedron is a polyhedron that is topologically equivalent to a torus which was discovered in the late 1940s by Ákos Császár (Gardner 1975). It has 7 polyhedron ...
...
View search results from all Wolfram sites (28983 matches)

