blockversewordysbillionaire.aiyourlistWhiteboardAppquizieunschool

News

Home
Popular
Elections

Genius — OpenServe

Sponsored

Ore's theorem — latest news, discussion & facts — IJR

Ore's theorem

Topic

Ore's theorem

theorem that a graph in which every two nonadjacent vertices have high degree sum must have a Hamiltonian cycle

0members1here now

Ask Genius Site

Feed Discussions About

Loading

Comments

Ask Genius by OpenServe:

Free account · your comment posts right after signup

About Ore's theorem

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.

0

members

1

here now

Everything about Ore's theorem →

Live room · 1 here

Be the first in the room — members see you arrive.

Facts from Wikidata (CC0).