REVIEW 1 cited by
On the growth rate of chromatic numbers of finite subgraphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
We prove that, for every function $f:\mathbb{N} \rightarrow \mathbb{N}$, there is a graph $G$ with uncountable chromatic number such that, for every $k \in \mathbb{N}$ with $k \geq 3$, every subgraph of $G$ with fewer than $f(k)$ vertices has chromatic number less than $k$. This answers a question of Erd\H{o}s, Hajnal, and Szemeredi.
Forward citations
Cited by 1 Pith paper
-
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 cont...
Discussion (0). Continue with ORCID to comment.