File:Ore theorem proof.svg
Size of this PNG preview of this SVG file: 441 × 207 pixels. Other resolutions: 320 × 150 pixels | 640 × 300 pixels | 1,024 × 481 pixels | 1,280 × 601 pixels | 2,560 × 1,202 pixels.
Original file (SVG file, nominally 441 × 207 pixels, file size: 2 KB)
Captions
Captions
Illustration for the proof of Ore's theorem
Summary edit
| 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 edit
I, the copyright holder of this work, hereby publish it under the following license:
 
|
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.
|
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 06:02, 14 January 2019 | | 441 × 207 (2 KB) | David Eppstein (talk | contribs) | User created page with UploadWizard |
You cannot overwrite this file.
File usage on Commons
The following page uses this file:
File usage on other wikis
The following other wikis use this file:
- Usage on en.wikipedia.org
- Usage on ja.wikipedia.org
- Usage on zh.wikipedia.org
