covering number

The number of vertices in a minimum vertex cover of a graph, often denoted as .See Also: edge covering number
Wikipedia foundation.
Look at other dictionaries:
Covering number — Not to be confused with Winding number or degree of a continuous mapping, sometimes called covering number or engulfing number . In mathematics, the ε covering number of a metric space (X, d), for some ε > 0, is the minimum… … Wikipedia
edge covering number — noun the number of edges in a minimum edge cover of a graph, often denoted as . See Also: covering number … Wiktionary
Covering — may refer to: Mathematics In topology: Covering map, a function from one space to another with uniform local neighborhoods Cover (topology), a system of (usually, open or closed) sets whose union is a given topological space Lebesgue covering… … Wikipedia
Covering (graph theory) — In the mathematical discipline of graph theory, a covering (or cover) of a graph is a set of vertices (or edges) such that each edge (vertex) of the graph touches (is incident with) at least one element of the set.It is of mathematical interest… … Wikipedia
Covering set — In mathematics, a covering set for a sequence of integers refers to a set of prime numbers such that every term in the sequence is divisible by at least one member of the set. The term covering set is used only in conjunction with sequences… … Wikipedia
Covering system — In mathematics, a covering system (also called a complete residue system) is a collection of finitely many residue classes whose union covers all the integers. Unsolved problems in mathematics For any arbitrarily large natural number N does there … Wikipedia
Covering lemma — See also: Jensen s covering theorem In mathematics, under various anti large cardinal assumptions, one can prove the existence of the canonical inner model, called the Core Model, that is, in a sense, maximal and approximates the structure of V.… … Wikipedia
number game — Introduction any of various puzzles and games that involve aspects of mathematics. Mathematical recreations comprise puzzles and games that vary from naive amusements to sophisticated problems, some of which have never been solved.… … Universalium
Covering problem of Rado — The covering problem of Rado is an unsolved problem in geometry concerning covering planar sets by squares. It was formulated in 1928 by Tibor Radó and has been generalized to more general shapes and higher dimensions by Richard Rado. Formulation … Wikipedia
Covering problem — In combinatorics and computer science, covering problems are computational problems that ask whether a certain combinatorial structure covers another, or how large the structure has to be to do that. Covering problems are minimization problems… … Wikipedia