Coloring finite substructures of countable structures
In ``Strong embeddings of graphs into colored graphs [in: A. Hajnal et al. (eds.), Colloq. Math. Soc. János Bolyai 10, 585-595 (1975; Zbl 0312.05123)], \textit{P. Erdős}, \textit{A. Hajnal} and \textit{L. Pósa} exhibited an interesting partition of the edges of the Rado, or universal graph. Consequently, partitions of substructures of relational structures having similar properties have been found. We abstract those properties, derive some important consequences and provide other examples in which such partitions occurred. For the entire collection see [Zbl 0999.00016].
- The use of elementary substructures in combinatorics
- Rainbow Ramsey simple structures
- Forbidden subgraphs and forbidden substructures
- On first-order definable colorings
- Partitions and orientations of the Rado graph
- Coloring finite subsets of uncountable sets
- scientific article; zbMATH DE number 3487493 (Why is no real title available?)
- Atoms and partial orders of infinite languages
- scientific article; zbMATH DE number 1506513 (Why is no real title available?)
- scientific article; zbMATH DE number 887764 (Why is no real title available?)
- Another look at the Erdős-Hajnal-Pósa results on partitioning edges of the Rado graph
- Colouring and non-productivity of \(\aleph_ 2\)-c.c
- Coloring factors of substitutive infinite words
- Canonical partitions of universal structures
- Coloring subgraphs of the Rado graph
This page was built for publication: Coloring finite substructures of countable structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4410021)
