EntityQ225973· pop 13· linked from 7 articlesOre's theoremSign in to savetheorem that a graph in which every two nonadjacent vertices have high degree sum must have a Hamiltonian cycleConnectionsHamiltonian pathEntityglossary of graph theory termsEntityNorwayCountrydigital object identifierEntitygraph theoryEntitygraphEntityJSTOREntitycomplete graphEntitynodeEntitydirected graphEntitydegreeEntityregular graphEntityMathematical ReviewsEntityØystein OreEntitycomplete bipartite graphEntitystrongly connected componentEntityAmerican Mathematical MonthlyEntitypancyclic graphEntityJournal of Combinatorial TheoryEntityOre conditionEntityCategoriesExtremal graph theoryHamiltonian paths and cyclesTheorems in graph theory