Search Results for ""

The Hungarian algorithm finds a maximum independent edge set on a graph. The algorithm starts with any matching M and constructs a tree via a breadth-first search to find an ...

An integral embedding of a graph, not to be confused with an integral graph, is a graph drawn such that vertices are distinct points and all graph edges have integer lengths. ...

Roughly speaking, isospectral manifolds are drums that sound the same, i.e., have the same eigenfrequency spectrum. Two drums with differing area, perimeter, or genus can ...

"Jabulani polyhedron" is a term introduced here to refer to the polyhedron illustrated above which underlies the shape of the soccer ball used in the 2010 World Cup in South ...

The Jerabek hyperbola is a circumconic that is the isogonal conjugate of the Euler line (Kimberling 1998, p. 237). Since it is a circumconic passing through the orthocenter, ...

The Kubo-Martin-Schwinger (KMS) condition is a kind of boundary-value condition which naturally emerges in quantum statistical mechanics and related areas. Given a quantum ...

The Kronecker-Weber theorem, sometimes known as the Kronecker-Weber-Hilbert theorem, is one of the earliest known results in class field theory. In layman's terms, the ...

The Kuen surface is a special case of Enneper's negative curvature surfaces which can be given parametrically by x = (2(cosu+usinu)sinv)/(1+u^2sin^2v) (1) = ...

The large Witt graph, also called the octad graph (Brouwer) or Witt graph (DistanceRegular.org), is the graph whose vertices are the 759 blocks of a Steiner system S(5,8,24) ...

A short theorem used in proving a larger theorem. Related concepts are the axiom, porism, postulate, principle, and theorem. The late mathematician P. Erdős has often been ...