Generic Graph Construction
Baumgartner, James E.
J. Symbolic Logic, Tome 49 (1984) no. 1, p. 234-240 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
It is shown that if $ZF$ is consistent, then so is $ZFC + GCH +$ "There is a graph with cardinality $\aleph_2$ and chromatic number $\aleph_2$ such that every subgraph of cardinality $\leq \aleph_1$ has chromatic number $\leq \aleph_0$". This partially answers a question of Erdos and Hajnal.
Publié le : 1984-03-14
Classification:  
@article{1183741490,
     author = {Baumgartner, James E.},
     title = {Generic Graph Construction},
     journal = {J. Symbolic Logic},
     volume = {49},
     number = {1},
     year = {1984},
     pages = { 234-240},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183741490}
}

Baumgartner, James E. Generic Graph Construction. J. Symbolic Logic, Tome 49 (1984) no. 1, pp.  234-240. http://gdmltest.u-ga.fr/item/1183741490/