SHMARQL

Ore's theorem

<http://www.wikidata.org/entity/Q225973>

theorem that a graph in which every two nonadjacent vertices have high degree sum must have a Hamiltonian cycle
rdfs:label
"Ore's theorem"@en
schema:description
"theorem that a graph in which every two nonadjacent vertices have high degree sum must have a Hamiltonian cycle"@en
schema:dateModified "2026-04-17T07:14:57+00:00"^^xsd:dateTime
schema:version 2482364782
wikibase:identifiers 3
wikibase:sitelinks 13
wikibase:statements 11
p:P1318 wd:statement/Q225973-7667f282-40d5-2080-69c1-355f1d4349c8
p:P138 wd:statement/q225973-0B7EA216-315D-44D4-96C5-76CEAB279E8B
p:P2384 wd:statement/Q225973-A9FA4CEA-F6C6-4035-AA29-CA1AC3E4DA4D
p:P2579 wd:statement/Q225973-5413e26d-48be-6668-8ca8-c2620c9631d0
p:P2671 wd:statement/Q225973-F5AD706E-5742-4015-BEE9-98378F46B102
p:P31 wd:statement/Q225973-ECA3F094-E616-498C-8A54-3AD1607DE44D
p:P361 wd:statement/Q225973-43E62A70-065E-4449-94E4-21E1885A6D39
p:P6104 wd:statement/Q225973-4533B04C-1E8A-4963-A305-4E587CB0CCC5
p:P6366 wd:statement/Q225973-794748F7-21F1-4D8A-AAE3-EFA3AFB2183F
p:P646 wd:statement/Q225973-27D8561A-E00A-40EA-9501-B7FB2082062B
p:P7719 wd:statement/Q225973-3ac20330-4262-bf79-6577-daa4d6fa8908
p:direct-normalized/P2671 <http://g.co/kg/g/1yprv27cx>
p:direct-normalized/P6366 <https://makg.org/entity/2777942178>
wdt:P1318 Øystein Ore
wdt:P138 Øystein Ore
wdt:P2384 Hamiltonian graph
wdt:P2579 graph theory
wdt:P2671 "/g/1yprv27cx"
wdt:P31 theorem
wdt:P361 list of theorems
wdt:P6104 WikiProject Mathematics
wdt:P6366 "2777942178"
wdt:P646 "/m/08rfsf"
wdt:P7719 Dirac's theorem
Download as:
TurtleJSON-LDRDF/XML
data from SPARQL profile: Wikidata