𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A simple proof of a theorem of Jung

✍ Scribed by Douglas Bauer; Aurora Morgana; E.F. Schmeichel

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
393 KB
Volume
79
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Jung's theorem states that if G is a l-tough graph on n 3 11 vertices such that d(x) + d(y) 2 n -4 for all distinct nonadjacent vertices x, y, then G is hamiltonian. We give a simple proof of this theorem for graphs with 16 or more vertices.

πŸ“œ SIMILAR VOLUMES

A simple proof of Moser's theorem
A simple proof of Moser's theorem
✍ Zhu, Xuding πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 243 KB πŸ‘ 2 views

This article gives a simple proof of a result of Moser, which says that, for any rational number r between 2 and 3, there exists a planar graph G whose circular chromatic number is equal to r.

A simple proof of Menger's theorem
A simple proof of Menger's theorem
✍ William McCuaig πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 111 KB πŸ‘ 1 views

## Abstract A proof of Menger's theorem is presented.

A Simple Proof of a Theorem of Milner
A Simple Proof of a Theorem of Milner
✍ Gyula O.H. Katona πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 174 KB

## Dedicated to the memory of Eric C. Milner A new short proof is given for the following theorem of Milner: An intersecting, inclusion-free family of subsets of an n-element set has at most ( n W(n+1)Γ‚2X ) members.