Assertion: dodecahedron's vertex | /r/HasProperty | n ≥ 3
Facets:
Source sentences:
text: A simple graph with n vertices ( n ≥ 3 ) is Hamiltonian if every vertex has degree n / 2 or greater.
text: A simple graph with n vertices (n ≥ 3) is Hamiltonian if, for every pair of non-adjacent vertices, the sum of their degrees is n or greater (see Ore's theorem).