Search Results for ""

Vizing's theorem states that a graph can be edge-colored in either Delta or Delta+1 colors, where Delta is the maximum vertex degree of the graph. A graph with edge chromatic ...

Let G be an undirected graph, and let i denote the cardinal number of the set of externally active edges of a spanning tree T of G, j denote the cardinal number of the set of ...

Let Pi be a permutation of n elements, and let alpha_i be the number of permutation cycles of length i in this permutation. Picking Pi at random, it turns out that ...

A technique used by André (1887) to provide an elegant solution to the ballot problem (Hilton and Pederson 1991) and in study of Wiener processes (Doob 1953; Papoulis 1984, ...

A convex function is a continuous function whose value at the midpoint of every interval in its domain does not exceed the arithmetic mean of its values at the ends of the ...

A square matrix with constant skew diagonals. In other words, a Hankel matrix is a matrix in which the (i,j)th entry depends only on the sum i+j. Such matrices are sometimes ...

The function defined by chi_nu(z)=sum_(k=0)^infty(z^(2k+1))/((2k+1)^nu). (1) It is related to the polylogarithm by chi_nu(z) = 1/2[Li_nu(z)-Li_nu(-z)] (2) = ...

A closed three-dimensional figure (which may, according to some terminology conventions, be self-intersecting). Kern and Bland (1948, p. 18) define a solid as any limited ...

The de Longchamps ellipse of a triangle DeltaABC is the conic circumscribed on the incentral triangle and the Cevian triangle of the isogonal mittenpunkt X_(57). (Since a ...

A k-matching in a graph G is a set of k edges, no two of which have a vertex in common (i.e., an independent edge set of size k). Let Phi_k be the number of k-matchings in ...