Search Results for ""

The ratio of the independence number of a graph G to its vertex count is known as the independence ratio of G (Bollobás 1981). The product of the chromatic number and ...

An independent dominating set of a graph G is a set of vertices in G that is both an independent vertex set and a dominating set of G. The minimum size of an independent ...

The König-Egeváry theorem, sometimes simply called König's theorem, asserts that the matching number (i.e., size of a maximum independent edge set) is equal to the vertex ...

A tree with a finite number of branches at each fork and with a finite number of leaves at the end of each branch is called a finitely branching tree. König's lemma states ...

A generalization of the Kronecker decomposition theorem which states that every finitely generated Abelian group is isomorphic to the group direct sum of a finite number of ...

The lattice method is an alternative to long multiplication for numbers. In this approach, a lattice is first constructed, sized to fit the numbers being multiplied. If we ...

An ordinal number alpha>0 is called a limit ordinal iff it has no immediate predecessor, i.e., if there is no ordinal number beta such that beta+1=alpha (Ciesielski 1997, p. ...

For any algebraic number x of degree n>2, a rational approximation p/q to x must satisfy |x-p/q|>1/(q^n) for sufficiently large q. Writing r=n leads to the definition of the ...

The degree of a graph vertex of a graph is the number of graph edges which touch the graph vertex, also called the local degree. The graph vertex degree of a point A in a ...

The Meredith graph is a quartic nonhamiltonian graph on 70 nodes and 140 edges that is a counterexample to the conjecture that every 4-regular 4-connected graph is ...