TOPICS
Search

Search Results for ""


671 - 680 of 1833 for Disk_covering_problemSearch Results
There are several equivalent definitions of a closed set. Let S be a subset of a metric space. A set S is closed if 1. The complement of S is an open set, 2. S is its own set ...
A property that passes from a topological space to every subspace with respect to the relative topology. Examples are first and second countability, metrizability, the ...
A meromorphic function is a single-valued function that is analytic in all but possibly a discrete subset of its domain, and at those singularities it must go to infinity ...
The quotient space X/∼ of a topological space X and an equivalence relation ∼ on X is the set of equivalence classes of points in X (under the equivalence relation ∼) ...
The Kneser graphs are a class of graph introduced by Lovász (1978) to prove Kneser's conjecture. Given two positive integers n and k, the Kneser graph K(n,k), often denoted ...
An alkane graph is a tree in which vertices correspond to atoms and edges to carbon-carbon or hydrogen-carbon bonds in a chemical alkane. In chemistry, an alkane is an ...
If k|n, then the complete k-uniform hypergraph on n vertices decomposes into 1-factors, where a 1-factor is a set of n/k pairwise disjoint k-sets. Brouwer and Schrijver ...
The dodecadodecahedron is the uniform polyhedron with Maeder index 36 (Maeder 1997), Wenninger index 73 (Wenninger 1989), Coxeter index 45 (Coxeter et al. 1954), and Har'El ...
An imperfect graph G is a graph that is not perfect. Therefore, graphs G with omega(G)<chi(G) (1) where omega(G) is the clique number and chi(G) is the chromatic number are ...
The set of fixed points which do not move as a knot is transformed into itself is not a knot. The conjecture was proved in 1978 (Morgan and Bass 1984). According to Morgan ...
1 ... 65|66|67|68|69|70|71 ... 184 Previous Next

...