Search Results for ""

Also called Chvátal's art gallery theorem. If the walls of an art gallery are made up of n straight line segments, then the entire gallery can always be supervised by |_n/3_| ...

The Banach-Saks theorem is a result in functional analysis which proves the existence of a "nicely-convergent" subsequence for any sequence {f_n}={f_n}_(n in Z^*) of ...

The Berlekamp-van Lint-Seidel graph is the Hamiltonian strongly regular graph on 243 vertices with parameters (243,22,1,2). It is also distance-regular with intersection ...

The biconjugate gradient stabilized (BCGSTAB) method was developed to solve nonsymmetric linear systems while avoiding the often irregular convergence patterns of the ...

A bimagic cube is a (normal) magic cube that remains magic when all its elements are squared. Of course, even a normal magic cubic becomes nonnormal (i.e., contains ...

The blossom algorithm (Edmonds 1965) finds a maximum independent edge set in a (possibly weighted) graph. While a maximum independent edge set can be found fairly easily for ...

It is always possible to "fairly" divide a cake among n people using only vertical cuts. Furthermore, it is possible to cut and divide a cake such that each person believes ...

The Celmins-Swart snarks are the two snarks on 26 vertices and 39 edges illustrated above. They are implemented in the Wolfram Language as GraphData["CelminsSwartSnark1"] and ...

The Chebotarev density theorem is a complicated theorem in algebraic number theory which yields an asymptotic formula for the density of prime ideals of a number field K that ...

An official chessboard is an 8×8 board containing squares alternating in color between olive green and buff (where "buff" is a color variously defined as a moderate orange ...