Search Results for ""

The first (called the "Blanuša double" by Orbanić et al. 2004) and second (called the "Blanuša snark" by Orbanić et al. 2004) Blanuša snarks were the second and third snarks ...

A snark on 30 vertices with edge chromatic number 4. It is implemented in the Wolfram Language as GraphData["DoubleStarSnark"].

The Royle graphs are the two unique simple graphs on eight nodes whose sigma polynomials have nonreal roots (Read and Wilson 1998, p. 265). The sigma polynomials of these ...

The Watkins snark is the snark on 50 vertices ad 75 nodes illustrated above. It is implemented in the Wolfram Language as GraphData["WatkinsSnark"].

What is the area of the largest square that can be inscribed on a unit cube (Trott 2004, p. 104)? The answer is 9/8, given by a square with vertices (1/4, 0, 0), (0, 1, 1/4), ...

The mean triangle area of a triangle picked at random inside a unit cube is A^_=0.15107+/-0.00003, with variance var(A)=0.008426+/-0.000004. The distribution of areas, ...

An irregular dodecagonal cross in the shape of a dagger |. The six faces of a cube can be cut along seven edges and unfolded into a Latin cross (i.e., the Latin cross is the ...

Line segment picking is the process of picking line segments at random within a given shape in the plane, in space, or in a higher dimension. The most natural definition of a ...

Move a point Pi_0 along a line from an initial point to a final point. It traces out a line segment Pi_1. When Pi_1 is translated from an initial position to a final ...

The Robbins constant is the mean line segment length, i.e., the expected distance between two points chosen at random in cube line picking, namely Delta(3) = (1) = (2) = ...