Search Results for ""

If k|n, then the complete k-uniform hypergraph on n vertices decomposes into 1-factors, where a 1-factor is a set of n/k pairwise disjoint k-sets. Brouwer and Schrijver ...

A barrel solid of revolution composed of parallel circular top and bottom with a common axis and a side formed by a smooth curve symmetrical about the midplane. The term also ...

Bézout's theorem for curves states that, in general, two algebraic curves of degrees m and n intersect in m·n points and cannot meet in more than m·n points unless they have ...

Bilinski (1960) noted that by collapsing any one of the five zones of the rhombic icosahedron, a second rhombic dodecahedron distinct from the dual polyhedron of the ...

An incidence system (v, k, lambda, r, b) in which a set X of v points is partitioned into a family A of b subsets (blocks) in such a way that any two points determine lambda ...

A box-and-whisker plot (sometimes called simply a box plot) is a histogram-like method of displaying data, invented by J. Tukey. To create a box-and-whisker plot, draw a box ...

The point of concurrence of the joins of the vertices of a triangle and the points of contact of an inconic of the triangle (Veblen and Young 1938, p. 111; Eddy and Fritsch ...

The subset B of the Euclidean plane formed by the union of the interval [0,1] of the x-axis and all line segments of unit length passing through the origin which form an ...

Given a chord PQ of a circle, draw any other two chords AB and CD passing through its midpoint. Call the points where AD and BC meet PQ X and Y. Then M is also the midpoint ...

A polyhedron is said to be canonical if all its polyhedron edges touch a sphere and the center of gravity of their contact points is the center of that sphere. In other ...