Search Results for ""
1231 - 1240 of 13134 for Extremal graph theorySearch Results
A 15_3 configuration of 15 lines and 15 points, with three lines through three points, three points on every line, and containing no triangles. It is illustrated above in two ...
A number of attractive 12-compounds of the regular tetrahedron can be constructed. The compounds illustrated above will be implemented in a future version of the Wolfram ...
A tetraview is a visualization technique for bivariate complex functions. In the simplest case, the graph of a complex-valued function w=w(z) can be considered as a ...
A web diagram, also called a cobweb plot, is a graph that can be used to visualize successive iterations of a function y=f(x). In particular, the segments of the diagram ...
Combinatorics is the branch of mathematics studying the enumeration, combination, and permutation of sets of elements and the mathematical relations that characterize their ...
A set in which no element divides the sum of any nonempty subset of the other elements. For example, {2,3,5} is dividing, since 2|(3+5) (and 5|(2+3)), but {4,6,7} is ...
Let a_1=1 and define a_(n+1) to be the least integer greater than a_n which cannot be written as the sum of at most h>=2 addends among the terms a_1, a_2, ..., a_n. This ...
Combinatorial geometry is a blending of principles from the areas of combinatorics and geometry. It deals with combinations and arrangements of geometric objects and with ...
A special case of nim played by the following rules. Given a heap of size n, two players alternately select a heap and divide it into two unequal heaps. A player loses when ...
Every convex body B in the Euclidean plane with area A can be inscribed in a triangle of area at most equal to 2A (Gross 1918, Eggleston 1957). The worst possible fit ...
...
View search results from all Wolfram sites (34319 matches)

