Metraipolis › archive › dc_7b5e44e4baae

Simplicial vertex — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Simplicial_vertex
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T11:25:34.145Z
SHA-256 of the archived text
1645d5d4113a1dda52f8dd2fa7836246ec02eb64e35b414f3c7bee0aa74141f4
Stable URL of this page
https://metraipolis.com/documento/dc_7b5e44e4baae

How to cite

Simplicial vertex — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Simplicial_vertex (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_7b5e44e4baae (Metraipolis archive dc_7b5e44e4baae, sha256 1645d5d4113a1dda52f8dd2fa7836246ec02eb64e35b414f3c7bee0aa74141f4)
BibTeX
@misc{dc7b5e44e4baae,
  title = {Simplicial vertex — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Simplicial_vertex},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_7b5e44e4baae; sha256 1645d5d4113a1dda52f8dd2fa7836246ec02eb64e35b414f3c7bee0aa74141f4},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Simplicial_vertex. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In graph theory, a simplicial vertex v {\displaystyle v} is a vertex whose closed neighborhood N G [ v ] {\displaystyle N_{G}[v]} in a graph G {\displaystyle G} forms a clique, where every pair of neighbors is adjacent to each other. A vertex of a graph is bisimplicial if the set of it and its neighbours is the union of two cliques, and is k-simplicial if the set is the union of k cliques. A vertex is co-simplicial if its non-neighbours form an independent set. Addario-Berry et al. demonstrated that every even-hole-free graph (or more specifically, even-cycle-free graph, as 4-cycles are also excluded here) contains a bisimplicial vertex, which settled a conjecture by Reed. The proof was later shown to be flawed by Chudnovsky & Seymour, who gave a correct proof. Due to this property, the family of all even-cycle-free graphs is χ {\displaystyle \chi } -bounded.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; categoria «Graph theory»).
Fonte: Wikipedia in inglese, voce «Simplicial vertex» — https://en.wikipedia.org/wiki/Simplicial_vertex
Wikidata Q133850409 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q133850409
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Simplicial_vertex?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 1318940295, consultata il 2026-10-07T11:16:08.688Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: d507fc2cca8b77b7f0cdc5649733c501678c8c4683b8088019967387afe4037a