Metraipolis › archive › dc_2f70cdf2ff12

Triangle-free graph — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Triangle-free_graph
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T23:09:22.091Z
SHA-256 of the archived text
c654d2ad5ce102d9e18b9b384b6cfcb21553cbd062dbaf9d08dbc209f7c61ba3
Stable URL of this page
https://metraipolis.com/documento/dc_2f70cdf2ff12

How to cite

Triangle-free graph — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Triangle-free_graph (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_2f70cdf2ff12 (Metraipolis archive dc_2f70cdf2ff12, sha256 c654d2ad5ce102d9e18b9b384b6cfcb21553cbd062dbaf9d08dbc209f7c61ba3)
BibTeX
@misc{dc2f70cdf2ff12,
  title = {Triangle-free graph — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Triangle-free_graph},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_2f70cdf2ff12; sha256 c654d2ad5ce102d9e18b9b384b6cfcb21553cbd062dbaf9d08dbc209f7c61ba3},
  year = {2026}
}

Archived text

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

In the mathematical area of graph theory, a triangle-free graph is an undirected graph in which no three vertices form a triangle of edges. Triangle-free graphs may be equivalently defined as graphs with clique number ≤ 2, graphs with girth ≥ 4, graphs with no induced 3-cycle, or locally independent graphs. By Turán's theorem, the n-vertex triangle-free graph with the maximum number of edges is a complete bipartite graph in which the numbers of vertices on each side of the bipartition are as equal as possible.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «graph theory»).
Fonte: Wikipedia in inglese, voce «Triangle-free graph» — https://en.wikipedia.org/wiki/Triangle-free_graph
Wikidata Q7840044: «undirected graph in which no three vertices form a triangle of edges» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q7840044
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Triangle-free_graph?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 1376948469, consultata il 2026-10-07T22:47:33.198Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: eb8f1dc10b120d0c7afcb266db41d37cbef81b6f4a4bd0f9985451c850a30a29