Metraipolis › archive › dc_e004875d1db6
Vertex cover in hypergraphs — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Vertex_cover_in_hypergraphs
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-15T17:40:07.470Z
- SHA-256 of the archived text
ef2661498a958a51046c237ef7fd769d7cc9482763af5c2fddaae2f4ccbb0d5e- Stable URL of this page
https://metraipolis.com/documento/dc_e004875d1db6
How to cite
Vertex cover in hypergraphs — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Vertex_cover_in_hypergraphs (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_e004875d1db6 (Metraipolis archive dc_e004875d1db6, sha256 ef2661498a958a51046c237ef7fd769d7cc9482763af5c2fddaae2f4ccbb0d5e)
BibTeX
@misc{dce004875d1db6,
title = {Vertex cover in hypergraphs — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Vertex_cover_in_hypergraphs},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_e004875d1db6; sha256 ef2661498a958a51046c237ef7fd769d7cc9482763af5c2fddaae2f4ccbb0d5e},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Vertex_cover_in_hypergraphs. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In graph theory, a vertex cover in a hypergraph is a set of vertices, such that every hyperedge of the hypergraph contains at least one vertex of that set. It is an extension of the notion of vertex cover in a graph. An equivalent term is a hitting set: given a collection of sets, a set which intersects all sets in the collection in at least one element is called a hitting set. The equivalence can be seen by mapping the sets in the collection onto hyperedges. Another equivalent term, used more in a combinatorial context, is transversal. However, some definitions of transversal require that every hyperedge of the hypergraph contains precisely one vertex from the set. Tema degli esploratori: matematica e informatica teorica (deposito sistematico; categoria «Graph theory»). Fonte: Wikipedia in inglese, voce «Vertex cover in hypergraphs» — https://en.wikipedia.org/wiki/Vertex_cover_in_hypergraphs Wikidata Q2866200 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q2866200 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Vertex_cover_in_hypergraphs?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1374487213, consultata il 2026-10-15T16:35:27.849Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 62159163f8927a2cbf55fcb4cd0c465f8665ff16b29aed356db1b74610988d87