Search Results for ""

The Icosian game, also called the Hamiltonian game (Ball and Coxeter 1987, p. 262), is the problem of finding a Hamiltonian cycle along the edges of an dodecahedron, i.e., a ...

The Knödel graph W_(Delta,n) is a regular bipartite graph of vertex degree Delta on n nodes for even n>=2 and 1<=Delta<=|_log_2n_| with edges defined as follows. Label the ...

The Pratt certificate is a primality certificate based on Fermat's little theorem converse. Prior to the work of Pratt (1975), the Lucas-Lehmer test had been regarded purely ...

A real polynomial P is said to be stable if all its roots lie in the left half-plane. The term "stable" is used to describe such a polynomial because, in the theory of linear ...

The treewidth is a measure of the count of original graph vertices mapped onto any tree vertex in an optimal tree decomposition. Determining the treewidth of an arbitrary ...

Wyler's constant is defined as alpha_W = 9/(8pi^4)((pi^5)/(2^4·5!))^(1/4) (1) = 0.0072973... (2) = 1/(137.0360824...) (3) (Wyler 1969, 1971; OEIS A180872 and A180873), which ...

A n-crossed prism graph for positive even n (a term introduced here for the first time), is a graph obtained by taking two disjoint cycle graphs C_n and adding edges ...

Hex is a two-player game invented by Piet Hein in 1942 while a student at Niels Bohr's Institute for Theoretical Physics, and subsequently and independently by John Nash in ...

The Hadwiger-Nelson problem asks for the chromatic number of the plane, i.e., the minimum number of colors needed to color the plane if no two points at unit distance one ...

Many algorithms have been devised for determining the prime factors of a given number (a process called prime factorization). They vary quite a bit in sophistication and ...