Henson graph
id:
henson-graph-267-8426896
title:
Henson graph
text:
In graph theory, the Henson graph Gi is an undirected infinite graph, the unique countable homogeneous graph that does not contain an i-vertex clique but that does contain all Ki-free finite graphs as induced subgraphs. For instance, G3 is a triangle-free graph that contains all finite triangle-free graphs. These graphs are named after C. Ward Henson, who published a construction for them in 1971. The first of these graphs, G3, is also called the homogeneous triangle-free graph or the universal
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Henson_graph
date created:
date modified:
2020-04-16T17:23:51Z
main entity:
{"identifier":"Q25304614","url":"https://www.wikidata.org/entity/Q25304614"}
image:
fields total:
13
integrity:
13