Search Results for ""

The Brinkmann graph (misspelled by Cancela et al. (2004) as "Brinkman") is a weakly regular quartic graph on 21 vertices and 42 edges. It was first mentioned in Brinkmann ...

Define the first Brocard point as the interior point Omega of a triangle for which the angles ∠OmegaAB, ∠OmegaBC, and ∠OmegaCA are equal to an angle omega. Similarly, define ...

The Brocard axis is the line KO passing through the symmedian point K and circumcenter O of a triangle, where the segment OK is the Brocard diameter (Kimberling 1998, p. ...

The Brocard circle, also known as the seven-point circle, is the circle having the line segment connecting the circumcenter O and symmedian point K of a triangle DeltaABC as ...

Brocard's problem asks to find the values of n for which n!+1 is a square number m^2, where n! is the factorial (Brocard 1876, 1885). The only known solutions are n=4, 5, and ...

The Brouwer-Haemers graph is the unique strongly regular graph on 81 vertices with parameters nu=81, k=20, lambda=1, mu=6 (Brouwer and Haemers 1992, Brouwer). It is also ...

The Buffon-Laplace needle problem asks to find the probability P(l,a,b) that a needle of length l will land on at least one line, given a floor with a grid of equally spaced ...

A cactus graph, sometimes also called a cactus tree, a mixed Husimi tree, or a polygonal cactus with bridges, is a connected graph in which any two graph cycles have no edge ...

The café wall illusion, sometimes also called the Münsterberg illusion (Ashton Raggatt McDougall 2006), is an optical illusion produced by a black and white rectangular ...

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 ...