Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Ores_theorem> ?p ?o }
Showing triples 1 to 52 of
52
with 100 triples per page.
- Ores_theorem abstract "Ore's theorem is a result in graph theory proved in 1960 by Norwegian mathematician Øystein Ore. It gives a sufficient condition for a graph to be Hamiltonian, essentially stating that a graph with \"sufficiently many edges\" must contain a Hamilton cycle. Specifically, the theorem considers the sum of the degrees of pairs of non-adjacent vertices: if every such pair has a sum that at least equals the total number of vertices in the graph, then the graph is Hamiltonian.".
- Ores_theorem wikiPageID "3100586".
- Ores_theorem wikiPageLength "8426".
- Ores_theorem wikiPageOutDegree "29".
- Ores_theorem wikiPageRevisionID "702639761".
- Ores_theorem wikiPageWikiLink American_Mathematical_Monthly.
- Ores_theorem wikiPageWikiLink Category:Articles_containing_proofs.
- Ores_theorem wikiPageWikiLink Category:Extremal_graph_theory.
- Ores_theorem wikiPageWikiLink Category:Hamiltonian_paths_and_cycles.
- Ores_theorem wikiPageWikiLink Category:Theorems_in_graph_theory.
- Ores_theorem wikiPageWikiLink Complete_bipartite_graph.
- Ores_theorem wikiPageWikiLink Complete_graph.
- Ores_theorem wikiPageWikiLink Degree_(graph_theory).
- Ores_theorem wikiPageWikiLink Directed_graph.
- Ores_theorem wikiPageWikiLink Graph_(discrete_mathematics).
- Ores_theorem wikiPageWikiLink Graph_theory.
- Ores_theorem wikiPageWikiLink Hamiltonian_path.
- Ores_theorem wikiPageWikiLink Incidence_matrix.
- Ores_theorem wikiPageWikiLink Journal_of_Combinatorial_Theory.
- Ores_theorem wikiPageWikiLink Norway.
- Ores_theorem wikiPageWikiLink Pancyclic_graph.
- Ores_theorem wikiPageWikiLink Regular_graph.
- Ores_theorem wikiPageWikiLink Strongly_connected_component.
- Ores_theorem wikiPageWikiLink Vertex_(graph_theory).
- Ores_theorem wikiPageWikiLink Øystein_Ore.
- Ores_theorem wikiPageWikiLinkText "Ore's theorem".
- Ores_theorem wikiPageUsesTemplate Template:Citation.
- Ores_theorem wikiPageUsesTemplate Template:For.
- Ores_theorem wikiPageUsesTemplate Template:Harv.
- Ores_theorem wikiPageUsesTemplate Template:Harvtxt.
- Ores_theorem wikiPageUsesTemplate Template:Math.
- Ores_theorem wikiPageUsesTemplate Template:Mvar.
- Ores_theorem subject Category:Articles_containing_proofs.
- Ores_theorem subject Category:Extremal_graph_theory.
- Ores_theorem subject Category:Hamiltonian_paths_and_cycles.
- Ores_theorem subject Category:Theorems_in_graph_theory.
- Ores_theorem hypernym Result.
- Ores_theorem type Object.
- Ores_theorem type Proof.
- Ores_theorem type Theorem.
- Ores_theorem comment "Ore's theorem is a result in graph theory proved in 1960 by Norwegian mathematician Øystein Ore. It gives a sufficient condition for a graph to be Hamiltonian, essentially stating that a graph with \"sufficiently many edges\" must contain a Hamilton cycle. Specifically, the theorem considers the sum of the degrees of pairs of non-adjacent vertices: if every such pair has a sum that at least equals the total number of vertices in the graph, then the graph is Hamiltonian.".
- Ores_theorem label "Ore's theorem".
- Ores_theorem sameAs Q225973.
- Ores_theorem sameAs Ore-tétel.
- Ores_theorem sameAs Twierdzenie_Orego.
- Ores_theorem sameAs Teorema_de_Ore.
- Ores_theorem sameAs m.08rfsf.
- Ores_theorem sameAs Теорема_Оре.
- Ores_theorem sameAs Oreho_veta.
- Ores_theorem sameAs Q225973.
- Ores_theorem wasDerivedFrom Ores_theorem?oldid=702639761.
- Ores_theorem isPrimaryTopicOf Ores_theorem.