Jump to content

Covering: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
Addbot (talk | contribs)
m Bot: Migrating 1 interwiki links, now provided by Wikidata on d:q5179248
Covering code
Line 16: Line 16:
**[[path cover]], a family of paths that includes every vertex
**[[path cover]], a family of paths that includes every vertex
**[[biclique cover]], a family of complete bipartite graphs that includes every edge
**[[biclique cover]], a family of complete bipartite graphs that includes every edge
* [[Covering code]], where every word is close to some codeword
* [[Covering lemma]] in set theory (specifically large cardinal theory)
* [[Covering lemma]] in set theory (specifically large cardinal theory)
* [[Covering number]] of a metric space, the minimum number of smaller balls needed to cover a unit ball
* [[Covering number]] of a metric space, the minimum number of smaller balls needed to cover a unit ball

Revision as of 11:07, 16 May 2014

Covering may refer to:

Mathematics

  • In topology:
  • In graph theory:
    • Vertex cover – a set of vertices incident on every edge
    • Edge cover – a set of edges incident on every vertex
    • Covering graph – a graph related to another graph via a covering map
    • cycle double cover, a family of cycles that includes every edge exactly twice
    • clique cover, a family of cliques that includes every vertex
    • path cover, a family of paths that includes every vertex
    • biclique cover, a family of complete bipartite graphs that includes every edge
  • Covering code, where every word is close to some codeword
  • Covering lemma in set theory (specifically large cardinal theory)
  • Covering number of a metric space, the minimum number of smaller balls needed to cover a unit ball
  • Covering problems, computational tasks of finding a small family of sets whose union is a given set
  • Covering set, in number theory, a set of prime numbers dividing all the elements of a sequence of numbers

Other

See also