For every growth function f, there are uncountably dichromatic digraphs of size continuum in which every (n+2)-dichromatic finite subdigraph has at least f(n) vertices, and it is consistent with arbitrarily large continuum that the same holds with optimal size for every infinite cardinal kappa up…
Komjáth, The chromatic number of infinite graphs—a survey , Discrete Math
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On the growth rate of dichromatic numbers of finite subdigraphs
For every growth function f, there are uncountably dichromatic digraphs of size continuum in which every (n+2)-dichromatic finite subdigraph has at least f(n) vertices, and it is consistent with arbitrarily large continuum that the same holds with optimal size for every infinite cardinal kappa up…