Search Results for ""

A weakly perfect graph is a graph for which omega(G)=chi(G) (without any requirement that this condition also hold on induced subgraphs, which is required for a graph to be ...

A tree to whose nodes and/or edges labels (usually number) are assigned. The word "weight" also has a more specific meaning when applied to trees, namely the weight of a tree ...

Let B_n(r) be the n-dimensional closed ball of radius r>1 centered at the origin. A function which is defined on B(r) is called an extension to B(r) of a function f defined ...

Conditions arising in the study of the Robbins axiom and its connection with Boolean algebra. Winkler studied Boolean conditions (such as idempotence or existence of a zero) ...

The method of d'Alembert provides a solution to the one-dimensional wave equation (partial^2y)/(partialx^2)=1/(c^2)(partial^2y)/(partialt^2) (1) that models vibrations of a ...

de Rham cohomology is a formal set-up for the analytic problem: If you have a differential k-form omega on a manifold M, is it the exterior derivative of another differential ...

A connective in logic which yields true if all conditions are true, and false if any condition is false. A AND B is denoted A ^ B (Mendelson 1997, p. 12), A&B, A intersection ...

An automorphic graph is a distance-transitive graph Gamma for which the automorphism group Aut(Gamma) acts primitively on the vertices of Gamma and is not a complete graph or ...

Bézout's theorem for curves states that, in general, two algebraic curves of degrees m and n intersect in m·n points and cannot meet in more than m·n points unless they have ...

A reduction system is called confluent (or globally confluent) if, for all x, u, and w such that x->_*u and x->_*w, there exists a z such that u->_*z and w->_*z. A reduction ...