Generic graph construction

Journal of Symbolic Logic 49 (1):234-240 (1984)
  Copy   BIBTEX

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,227

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
25 (#636,202)

6 months
12 (#219,036)

Historical graph of downloads
How can I increase my downloads?