List-compactness of infinite directed graphs
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.
- Cores and compactness of infinite directed graphs
- Compactness and finite equivalence of infinite digraphs
- Ramsey-type results on singletons, co-singletons and monotone sequences in large collections of sets
- The quest for a characterization of hom-properties of finite character
- scientific article; zbMATH DE number 4177092 (Why is no real title available?)
- A polynomial Ramsey statement for bounded VC-dimension
This page was built for publication: List-compactness of infinite directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5936089)
