Search Results for ""

There are essentially three types of Fisher-Tippett extreme value distributions. The most common is the type I distribution, which are sometimes referred to as Gumbel types ...

A clique of a graph G is a complete subgraph of G, and the clique of largest possible size is referred to as a maximum clique (which has size known as the (upper) clique ...

A maximal independent edge set of a graph is an independent edge set that cannot be expanded to another independent edge set by addition of any edge in the graph. Note that a ...

König's line coloring theorem states that the edge chromatic number of any bipartite graph equals its maximum vertex degree. In other words, every bipartite graph is a class ...

The party problem, also known as the maximum clique problem, asks to find the minimum number of guests that must be invited so that at least m will know each other or at ...

A domatic partition is a partition of the vertices of a graph into disjoint dominating sets. The maximum number of disjoint dominating sets in a domatic partition of a graph ...

In one dimension, the Gaussian function is the probability density function of the normal distribution, f(x)=1/(sigmasqrt(2pi))e^(-(x-mu)^2/(2sigma^2)), (1) sometimes also ...

If a univariate real function f(x) has a single critical point and that point is a local maximum, then f(x) has its global maximum there (Wagon 1991, p. 87). The test breaks ...

The conjecture that, for any triangle, 8omega^3<ABC (1) where A, B, and C are the vertex angles of the triangle and omega is the Brocard angle. The Abi-Khuzam inequality ...

A path constructed by repeatedly finding a path of positive capacity from a source to a sink and then adding it to the flow (Skiena 1990, p. 237). An augmenting path for a ...