Английская Википедия:Henson graph

Материал из Онлайн справочника
Перейти к навигацииПерейти к поиску

In graph theory, the Henson graph Шаблон:Math is an undirected infinite graph, the unique countable homogeneous graph that does not contain an Шаблон:Mvar-vertex clique but that does contain all Шаблон:Mvar-free finite graphs as induced subgraphs. For instance, Шаблон:Math 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 (for all Шаблон:Math) in 1971.[1] The first of these graphs, Шаблон:Math, is also called the homogeneous triangle-free graph or the universal triangle-free graph.

Construction

To construct these graphs, Henson orders the vertices of the Rado graph into a sequence with the property that, for every finite set Шаблон:Mvar of vertices, there are infinitely many vertices having Шаблон:Mvar as their set of earlier neighbors. (The existence of such a sequence uniquely defines the Rado graph.) He then defines Шаблон:Math to be the induced subgraph of the Rado graph formed by removing the final vertex (in the sequence ordering) of every Шаблон:Mvar-clique of the Rado graph.[1]

With this construction, each graph Шаблон:Math is an induced subgraph of Шаблон:Math, and the union of this chain of induced subgraphs is the Rado graph itself. Because each graph Шаблон:Math omits at least one vertex from each Шаблон:Mvar-clique of the Rado graph, there can be no Шаблон:Mvar-clique in Шаблон:Math.

Universality

Any finite or countable Шаблон:Mvar-clique-free graph Шаблон:Mvar can be found as an induced subgraph of Шаблон:Math by building it one vertex at a time, at each step adding a vertex whose earlier neighbors in Шаблон:Math match the set of earlier neighbors of the corresponding vertex in Шаблон:Mvar. That is, Шаблон:Math is a universal graph for the family of Шаблон:Mvar-clique-free graphs.

Because there exist Шаблон:Mvar-clique-free graphs of arbitrarily large chromatic number, the Henson graphs have infinite chromatic number. More strongly, if a Henson graph Шаблон:Math is partitioned into any finite number of induced subgraphs, then at least one of these subgraphs includes all Шаблон:Mvar-clique-free finite graphs as induced subgraphs.[1]

Symmetry

Like the Rado graph, Шаблон:Math contains a bidirectional Hamiltonian path such that any symmetry of the path is a symmetry of the whole graph. However, this is not true for Шаблон:Math when Шаблон:Math: for these graphs, every automorphism of the graph has more than one orbit.[1]

References

Шаблон:Reflist