List-compactness of infinite directed graphs (Q5936089)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: List-compactness of infinite directed graphs |
scientific article; zbMATH DE number 1612983
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | List-compactness of infinite directed graphs |
scientific article; zbMATH DE number 1612983 |
Statements
List-compactness of infinite directed graphs (English)
0 references
7 August 2002
0 references
The paper is a free continuation of the article [\textit{B. L. Bauslaugh}, J. Comb. Theory, Ser. B 68, No. 2, 255-276 (1996; Zbl 0861.05028)], where compactness of infinite digraphs was observed; see also \textit{N. G. de Bruijn} and \textit{P. Erdős} [Indag. Math. 13, 371-373 (1951; Zbl 0044.38203)]. The author follows an idea of a generalization from homomorphisms to list-homomorphisms. He defines a notion of compactness for list-homomorphisms. The well-known Tychonoff theorem on products of compact topological spaces and a version of Ramsey's theorem on the partition of \(A\times A\) for a given countable infinite set \(A\) into finitely many parts are used. It is shown that essentially only finite digraphs are compact with respect to list-homomorphisms. A remark on analogical results in the case of undirected graphs is included.
0 references
directed graphs
0 references
homomorphisms
0 references
list-compactness
0 references
0.8001593947410583
0 references
0.7941600680351257
0 references
0.7093258500099182
0 references
0.7023661136627197
0 references