Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
simple graphs
|
| gptkbp:field |
graph theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Dirac's theorem
|
| gptkbp:implies |
existence of Hamiltonian cycle
|
| gptkbp:minimumDegreeCondition |
n/2
|
| gptkbp:namedAfter |
gptkb:Gabriel_Andrew_Dirac
|
| gptkbp:relatedTo |
gptkb:Ore's_theorem
gptkb:Bondy–Chvátal_theorem |
| gptkbp:sentence |
Every simple graph with n vertices (n ≥ 3) in which every vertex has degree at least n/2 is Hamiltonian.
|
| gptkbp:usedIn |
Hamiltonian graph theory
|
| gptkbp:yearProposed |
1952
|
| gptkbp:bfsParent |
gptkb:Hamiltonian_graph
gptkb:Ore's_theorem |
| gptkbp:bfsLayer |
5
|