Scribd
Upload
411 views2 pages

Proof of Ore's Theorem

The document provides a proof of Ore's Theorem by contradiction. Ore's Theorem states that if a simple graph G with n vertices satisfies the condition that for any two non-adjacent vertices x and y, deg(x) + deg(y) ≥ n, then G has a Hamilton circuit. The proof assumes G does not have a Hamilton circuit and gradually adds missing edges to form a graph H with the same degree condition but still no Hamilton circuit. This leads to a contradiction by showing two vertices in H that should be adjacent based on their degrees are actually adjacent.

Uploaded by

mmrmathsiubd
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
411 views2 pages

Proof of Ore's Theorem

The document provides a proof of Ore's Theorem by contradiction. Ore's Theorem states that if a simple graph G with n vertices satisfies the condition that for any two non-adjacent vertices x and y, deg(x) + deg(y) ≥ n, then G has a Hamilton circuit. The proof assumes G does not have a Hamilton circuit and gradually adds missing edges to form a graph H with the same degree condition but still no Hamilton circuit. This leads to a contradiction by showing two vertices in H that should be adjacent based on their degrees are actually adjacent.

Uploaded by

mmrmathsiubd
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

PROOF OF ORES THEOREM

CHING-HAO,WANG

1. Ores Theorem
In this note, we prove the following result:
Theorem 1. Suppose that G is a simple graph with n vertices, n 3 and deg(x) +
deg(y) n whenever x and y are non-adjacent vertices in G, then G has a Hamilton
circuit.
Proof. We prove by contradiction:
(a)Suppose that deg(x) + deg(y) n for every pair of nonadjacent vertices x
and y in G. If G does not have a Hamilton circuit, continue as long as possible in
adding missing edges to G(since G is not necessarily a complete graph) one at a
time in such a way that we do not obtain a graph with a Hamilton circuit. This
cannot go on forever, because once weve formed the complete graph by adding all
missing edges, theres a Hamilton circuit. Whenever the process stops, we have
obtained a (necessarily non-complete) graph H with the desired property.
(b)If we add one more edge to H, this produce a Hamilton circuit, which uses
all added edges. The path consisting of this circuit with the added edge omitted is
the Hamilton path in H.
(c) Let v1 , v2 , vn be a Hamilton path in H. Clearly v1 and vn are not adjacent in H, because H has no Hamilton circuit. Therefore they are not adjacent in
G. By hypothesis,
deg(v1 ) + deg(vn ) n
We rewrite in the other form,
(n 1) deg(vn ) deg(v1 ) 1
, the left-hand-side(LHS) is just the number of vertices not adjacent to vn (not include vn itself).
(d) Let S be the set of vertices preceding each vertex adjacent to v1 in the Hamilton
path. Because theres no vertex following vn , so vn
/ S. Each one of the deg(v1 )
vertices adjacent to v1 gives rise to one element in S. So |S| = deg(v1 )
(e) By (c), there are at most deg(v1 ) 1 vertices other than vn not adjacent
to vn , and by (d) there are deg(v1 ) vertices in S, none of which is vn . Therefore
at least one vertex of S is adjacent to vn (since each of the deg(v1 ) vertices in S is
either adjacent or not adjacent to vn , but there are at most deg(v1 ) 1 vertices
Date: June 18, 2009.
1

CHING-HAO,WANG

not adjacent to vn ). Let vk be such an vertex and, by definition, H contains the


edges {vk vn }, {vk+1 v1 }, where 1 < k < n1 .
(f ) Now v1 , v2 , vk1 , vk , vn , vn1 , vk+1 , v1 is a Hamilton circuit in H, which
contradicts our construction of H. Therefore our assumption that G did not originally have a Hamilton circuit is wrong, and our proof by contradiction is complete.

References
[1] K. H. Rosen Discrete Mathematics and its applications, 6th ed., McGraw-Hill, 2007
[2] R. P. Grimaldi, Discrete and Combinatorial Mathematics, 5th ed., Addison Wesley, 2004.
Department of Electrical Engineering, National Tsing-Hua University, Hsinchu,
Taiwan, R.O.C., 30013

You might also like