Search Results for ""

A pair of vertices (x,y) of a graph G is called an omega-critical pair if omega(G+xy)>omega(G), where G+xy denotes the graph obtained by adding the edge xy to G and omega(H) ...

Consider a broadcast scheme on a connected graph from an originator vertex v in a graph G consisting of a sequence of parallel calls starting from v. In each time step, every ...

If a plane cuts the sides AB, BC, CD, and DA of a skew quadrilateral ABCD in points P, Q, R, and S, then (AP)/(PB)·(BQ)/(QC)·(CR)/(RD)·(DS)/(SA)=1 both in magnitude and sign ...

A coequalizer of a pair of maps f,g:X->Y in a category is a map c:Y->C such that 1. c degreesf=c degreesg, where degrees denotes composition. 2. For any other map c^':Y->C^' ...

A Colbert number is any prime number with more than 1000000 decimal digits whose discovery contributes to the long-sought after proof that k=78557 is the smallest Sierpiński ...

A planar polygon is convex if it contains all the line segments connecting any pair of its points. Thus, for example, a regular pentagon is convex (left figure), while an ...

The automorphism group Co_1 of the Leech lattice modulo a center of order two is called "the" Conway group. There are 15 exceptional conjugacy classes of the Conway group. ...

Given two crossed ladders resting against two buildings, what is the distance between the buildings? Let the height at which they cross be h and the lengths of the ladders ...

A (Delta,D)-graph is a graph with maximum vertex degree Delta and diameter at most D. The order of a graph with degree Delta of diameter D is bounded by ...

Eisenstein's irreducibility criterion is a sufficient condition assuring that an integer polynomial p(x) is irreducible in the polynomial ring Q[x]. The polynomial ...