Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Ultrahomogeneous_graph> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- Ultrahomogeneous_graph abstract "In mathematics, a k-ultrahomogeneous graph is a graph in which every isomorphism between two of its induced subgraphs of at most k vertices can be extended to an automorphism of the whole graph.If a graph is 5-ultrahomogeneous, then it is ultrahomogeneous for every k. The only finite connected graphs of this type are complete graphs, Turán graphs, 3 × 3 rook's graphs, and the 5-cycle.There are only two connected graphs that are 4-ultrahomogeneous but not 5-ultrahomogeneous: the Schläfli graph and its complement. The proof relies on the classification of finite simple groups.The infinite Rado graph is countably ultrahomogeneous.".
- Ultrahomogeneous_graph wikiPageID "34035216".
- Ultrahomogeneous_graph wikiPageRevisionID "473796539".
- Ultrahomogeneous_graph hasPhotoCollection Ultrahomogeneous_graph.
- Ultrahomogeneous_graph subject Category:Graph_theory.
- Ultrahomogeneous_graph comment "In mathematics, a k-ultrahomogeneous graph is a graph in which every isomorphism between two of its induced subgraphs of at most k vertices can be extended to an automorphism of the whole graph.If a graph is 5-ultrahomogeneous, then it is ultrahomogeneous for every k.".
- Ultrahomogeneous_graph label "Ultrahomogeneous graph".
- Ultrahomogeneous_graph sameAs m.0hrdjl3.
- Ultrahomogeneous_graph sameAs Q7880542.
- Ultrahomogeneous_graph sameAs Q7880542.
- Ultrahomogeneous_graph wasDerivedFrom Ultrahomogeneous_graph?oldid=473796539.
- Ultrahomogeneous_graph isPrimaryTopicOf Ultrahomogeneous_graph.