Generic graph construction

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


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 31,396
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
In Memoriam: James Earl Baumgartner.J. A. Larson - 2017 - Archive for Mathematical Logic 56 (7-8):877-909.
Erdős and Set Theory.Akihiro Kanamori - 2014 - Bulletin of Symbolic Logic 20 (4):449-490,.
The Journal of Symbolic Logic.Péter Komjáth - 2001 - Bulletin of Symbolic Logic 7 (4):539-541.

Add more citations

Similar books and articles
Added to PP index
2009-01-28

Total downloads
6 ( #621,425 of 2,225,996 )

Recent downloads (6 months)
1 ( #428,365 of 2,225,996 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature