File:Ore theorem example.svg

Original file(SVG file, nominally 306 × 252 pixels, file size: 679 bytes)

Summary

Description
English: A graph illustrating Ore's theorem, that when all pairs of nonadjacent vertices have degrees summing to at least n, the graph has a Hamiltonian cycle. Here, the two degree-three vertices in the center are adjacent, and all other pairs of vertices have degrees summing to at least seven, the number of vertices. Because some vertices have fewer than n/2 neighbors, the conditions for the weaker Dirac theorem on Hamiltonian cycles are not met. A Hamiltonian cycle is highlighted.
Date
Source Own work
Author David Eppstein

Licensing

I, the copyright holder of this work, hereby publish it under the following license:
Creative Commons CC-Zero This file is made available under the Creative Commons CC0 1.0 Universal Public Domain Dedication.
The person who associated a work with this deed has dedicated the work to the public domain by waiving all of their rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law. You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.

Captions

Example of Ore's theorem

Items portrayed in this file

depicts

13 January 2019

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeThumbnailDimensionsUserComment
current05:36, 14 January 2019Thumbnail for version as of 05:36, 14 January 2019306 × 252 (679 bytes)David EppsteinUser created page with UploadWizard
The following pages on the English Wikipedia use this file (pages on other projects are not listed):

Global file usage

The following other wikis use this file:

Metadata