Generic graph construction
- 12 March 1984
- journal article
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 49 (1) , 234-240
- https://doi.org/10.2307/2274106
Abstract
It is shown that if ZF is consistent, then so is ZFC + GCH + “There is a graph with cardinality ℵ2 and chromatic number ℵ2 such that every subgraph of cardinality ≤ ℵ1, has chromatic number ≤ ℵ0”. This partially answers a question of Erdös and Hajnal.Keywords
This publication has 2 references indexed in Scilit:
- Combinatorial set theory: N. H. Williams, North-Holland, 1977, 208 ppAdvances in Mathematics, 1978
- Finite and Infinite SetsThe Mathematical Gazette, 1968