Generic graph construction

Journal of Symbolic Logic 49 (1):234-240 (1984)
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 Erdos and Hajnal
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2274106
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 24,433
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Akihiro Kanamori (2015). Erdős and Set Theory. Bulletin of Symbolic Logic 20 (4):449-490,.
Péter Komjáth (2001). The Journal of Symbolic Logic. Bulletin of Symbolic Logic 7 (4):539-541.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

5 ( #572,984 of 1,924,986 )

Recent downloads (6 months)

1 ( #417,998 of 1,924,986 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.