🌐EnglishEnglishDeutschFrançaisItalianoNederlandsPolskiPortuguêsTürkçeРусскийالعربية中文日本語EntityQ225973· pop 13· linked from 7 articlesOre's theoremtheorem that a graph in which every two nonadjacent vertices have high degree sum must have a Hamiltonian cycleAvailable in 13 languages中文日本語РусскийPortuguêsItalianoالعربيةHebrewHungarianNederlandsPolskiSlovakConnectionsHamiltonian pathEntityglossary of graph theory termsEntityCategoriesExtremal graph theoryHamiltonian paths and cyclesTheorems in graph theory