Ore's theorem
id:
ore-s-theorem-294-7113279
title:
Ore's theorem
text:
Ore's theorem is a result in graph theory proved in 1960 by Norwegian mathematician Øystein Ore. It gives a sufficient condition for a graph to be Hamiltonian, essentially stating that a graph with sufficiently many edges must contain a Hamilton cycle. Specifically, the theorem considers the sum of the degrees of pairs of non-adjacent vertices: if every such pair has a sum that at least equals the total number of vertices in the graph, then the graph is Hamiltonian.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Ore%27s_theorem
date created:
date modified:
2021-07-05T02:47:24Z
main entity:
{"identifier":"Q225973","url":"https://www.wikidata.org/entity/Q225973"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/f/f9/Ore_theorem_example.svg","width":306,"height":252}
fields total:
13
integrity:
14