Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Turxc3xa1ns_theorem> ?p ?o }
Showing triples 1 to 64 of
64
with 100 triples per page.
- Turxc3xa1ns_theorem abstract "In graph theory, Turán's theorem is a result on the number of edges in a Kr+1-free graph.An n-vertex graph that does not contain any (r + 1)-vertex clique may be formed by partitioning the set of vertices into r parts of equal or nearly equal size, and connecting two vertices by an edge whenever they belong to two different parts. We call the resulting graph the Turán graph T(n, r). Turán's theorem states that the Turán graph has the largest number of edges among all Kr+1-free n-vertex graphs.Turán graphs were first described and studied by Hungarian mathematician Pál Turán in 1941, though a special case of the theorem was stated earlier by Mantel in 1907.".
- Turxc3xa1ns_theorem wikiPageExternalLink 1966-21.pdf.
- Turxc3xa1ns_theorem wikiPageID "360601".
- Turxc3xa1ns_theorem wikiPageLength "8152".
- Turxc3xa1ns_theorem wikiPageOutDegree "29".
- Turxc3xa1ns_theorem wikiPageRevisionID "674416304".
- Turxc3xa1ns_theorem wikiPageWikiLink Category:Articles_containing_proofs.
- Turxc3xa1ns_theorem wikiPageWikiLink Category:Extremal_graph_theory.
- Turxc3xa1ns_theorem wikiPageWikiLink Category:Theorems_in_graph_theory.
- Turxc3xa1ns_theorem wikiPageWikiLink Clique_(graph_theory).
- Turxc3xa1ns_theorem wikiPageWikiLink Complete_bipartite_graph.
- Turxc3xa1ns_theorem wikiPageWikiLink Complete_graph.
- Turxc3xa1ns_theorem wikiPageWikiLink Complete_multipartite_graph.
- Turxc3xa1ns_theorem wikiPageWikiLink Equivalence_class.
- Turxc3xa1ns_theorem wikiPageWikiLink Equivalence_classes.
- Turxc3xa1ns_theorem wikiPageWikiLink Erdős–Stone_theorem.
- Turxc3xa1ns_theorem wikiPageWikiLink Extremal_graph_theory.
- Turxc3xa1ns_theorem wikiPageWikiLink Glossary_of_graph_theory.
- Turxc3xa1ns_theorem wikiPageWikiLink Graph_(mathematics).
- Turxc3xa1ns_theorem wikiPageWikiLink Graph_theory.
- Turxc3xa1ns_theorem wikiPageWikiLink Hungary.
- Turxc3xa1ns_theorem wikiPageWikiLink Intersection_number_(graph_theory).
- Turxc3xa1ns_theorem wikiPageWikiLink Journal_of_Combinatorial_Theory.
- Turxc3xa1ns_theorem wikiPageWikiLink Mathematician.
- Turxc3xa1ns_theorem wikiPageWikiLink Method_of_conditional_probabilities.
- Turxc3xa1ns_theorem wikiPageWikiLink Multipartite_graph.
- Turxc3xa1ns_theorem wikiPageWikiLink Pancyclic_graph.
- Turxc3xa1ns_theorem wikiPageWikiLink Prentice_Hall.
- Turxc3xa1ns_theorem wikiPageWikiLink Proofs_from_THE_BOOK.
- Turxc3xa1ns_theorem wikiPageWikiLink Pál_Turán.
- Turxc3xa1ns_theorem wikiPageWikiLink Springer-Verlag.
- Turxc3xa1ns_theorem wikiPageWikiLink Springer_Science+Business_Media.
- Turxc3xa1ns_theorem wikiPageWikiLink Triangle-free_graph.
- Turxc3xa1ns_theorem wikiPageWikiLink Turxc3xa1ns_method.
- Turxc3xa1ns_theorem wikiPageWikiLink Turán_graph.
- Turxc3xa1ns_theorem wikiPageWikiLink Vertex_(graph_theory).
- Turxc3xa1ns_theorem wikiPageWikiLinkText "Turán's Graph Theorem".
- Turxc3xa1ns_theorem wikiPageWikiLinkText "Turán's theorem".
- Turxc3xa1ns_theorem wikiPageWikiLinkText "Turán's theorem#Mantel's theorem".
- Turxc3xa1ns_theorem wikiPageWikiLinkText "his theorem".
- Turxc3xa1ns_theorem hasPhotoCollection Turxc3xa1ns_theorem.
- Turxc3xa1ns_theorem wikiPageUsesTemplate Template:Citation.
- Turxc3xa1ns_theorem wikiPageUsesTemplate Template:Harv.
- Turxc3xa1ns_theorem wikiPageUsesTemplate Template:Math.
- Turxc3xa1ns_theorem wikiPageUsesTemplate Template:Mvar.
- Turxc3xa1ns_theorem subject Category:Articles_containing_proofs.
- Turxc3xa1ns_theorem subject Category:Extremal_graph_theory.
- Turxc3xa1ns_theorem subject Category:Theorems_in_graph_theory.
- Turxc3xa1ns_theorem comment "In graph theory, Turán's theorem is a result on the number of edges in a Kr+1-free graph.An n-vertex graph that does not contain any (r + 1)-vertex clique may be formed by partitioning the set of vertices into r parts of equal or nearly equal size, and connecting two vertices by an edge whenever they belong to two different parts. We call the resulting graph the Turán graph T(n, r).".
- Turxc3xa1ns_theorem label "Turán's theorem".
- Turxc3xa1ns_theorem sameAs Turánova_věta.
- Turxc3xa1ns_theorem sameAs Satz_von_Turán.
- Turxc3xa1ns_theorem sameAs Théorème_de_Turán.
- Turxc3xa1ns_theorem sameAs משפט_טורן.
- Turxc3xa1ns_theorem sameAs Turán-tétel.
- Turxc3xa1ns_theorem sameAs Twierdzenie_Turána.
- Turxc3xa1ns_theorem sameAs m.01_dgg.
- Turxc3xa1ns_theorem sameAs Теорема_Турана.
- Turxc3xa1ns_theorem sameAs Теорема_Турана.
- Turxc3xa1ns_theorem sameAs Q1047749.
- Turxc3xa1ns_theorem sameAs Q1047749.
- Turxc3xa1ns_theorem sameAs 图兰定理.
- Turxc3xa1ns_theorem wasDerivedFrom Turxc3xa1ns_theoremoldid=674416304.
- Turxc3xa1ns_theorem isPrimaryTopicOf Turxc3xa1ns_theorem.