Home › Entities › general › ultrahomogeneous graph

ultrahomogeneous graph

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
Thing general Q7880542
Press Enter · cited answer in seconds

ultrahomogeneous graph

Summary

Key Facts

  • ultrahomogeneous graph's subclass of is recorded as graph[1].
  • ultrahomogeneous graph's Freebase ID is recorded as /m/0hrdjl3[2].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [1] ↑ . wikidata.org.
  2. [2] ↑ . wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). ultrahomogeneous graph. Retrieved May 7, 2026, from https://4ort.xyz/entity/ultrahomogeneous-graph
MLA “ultrahomogeneous graph.” 4ort.xyz Knowledge Graph, 4ort.xyz, 7 May. 2026, https://4ort.xyz/entity/ultrahomogeneous-graph.
BibTeX @misc{4ortxyz_ultrahomogeneous-graph_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{ultrahomogeneous graph}}, year = {2026}, url = {https://4ort.xyz/entity/ultrahomogeneous-graph}, note = {Accessed: 2026-05-07}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): ultrahomogeneous graph — https://4ort.xyz/entity/ultrahomogeneous-graph (retrieved 2026-05-07)

Canonical URL: https://4ort.xyz/entity/ultrahomogeneous-graph · Last refreshed: