Jump to content

File:Ore theorem proof.svg

Page contents not supported in other languages.
This is a file from the Wikimedia Commons
From Wikipedia, the free encyclopedia

Original file (SVG file, nominally 441 × 207 pixels, file size: 2 KB)

Summary

Description
English: In a graph with the Hamiltonian path v1...vn but no Hamiltonian cycle, at most one of the two edges v1vi and vi − 1vn (shown as blue dashed curves) can exist. For, if they both exist, then adding them to the path and removing the (red) edge vi − 1vi would produce a Hamiltonian cycle.
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

Illustration for the proof of Ore's theorem

このファイルに描写されている項目

depicts

13 January 2019

File history

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

Date/TimeThumbnailDimensionsUserComment
current06:02, 14 January 2019Thumbnail for version as of 06:02, 14 January 2019441 × 207 (2 KB)David EppsteinUser created page with UploadWizard

The following page uses this file:

Global file usage

The following other wikis use this file:

Metadata