File:Ore theorem example.svg
Size of this PNG preview of this SVG file: 306 × 252 pixels. Other resolutions: 292 × 240 pixels | 583 × 480 pixels | 933 × 768 pixels | 1,244 × 1,024 pixels | 2,487 × 2,048 pixels.
Original file (SVG file, nominally 306 × 252 pixels, file size: 679 bytes)
 | This is a file from the Wikimedia Commons. Information from its description page there is shown below. Commons is a freely licensed media file repository. You can help. |
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:
 
|
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 | 05:36, 14 January 2019 | | 306 × 252 (679 bytes) | David Eppstein | User created page with UploadWizard |
File usage
The following page uses this file:
Global file usage
The following other wikis use this file:
- Usage on ja.wikipedia.org
- Usage on pt.wikipedia.org
- Usage on zh.wikipedia.org
