If \(G\) is a countable graph which has arbitrarily large cliques and the \(k\)-tuples of \(G\) are colored with a finite number of colors then there is an infinite chromatic subgraph on which the \(k\)-tuples get \(2^{k-1}\) colors. This is sharp if \(G\) does not contain infinite cliques. There is a countable triangle-free graph such that if the pairs are colored with finitely many colors then some 3 colors cover an infinite chromatic subgraph. There is a countable triangle-free graph which has for every finite \(k\) a \(k\)-coloring of the pairs so that the vertex set of every infinite chromatic subgraph uses all colors. The homogeneous countable \(n\)-clique free graph has for every finite \(k\) a \(k\)-coloring of the pairs of vertices such that infinite chromatic subsets necessarily use at least 3 colors.
- Chromatic graphs, Ramsey numbers and the flexible atom conjecture
- Coloring of universal graphs
- Borel chromatic numbers
- Ramsey's theorem for colors from a metric space
- On the abstract chromatic number and its computability for finitely axiomatizable theories
- scientific article; zbMATH DE number 5014483 (Why is no real title available?)
- Constructions of infinite graphs with Ramsey property
- The Ramsey theory of the universal homogeneous triangle-free graph
- The Ramsey theory of Henson graphs
This page was built for publication: Chromatic Ramsey theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5961465)
