Hostname: page-component-586b7cd67f-rdxmf Total loading time: 0 Render date: 2024-11-22T23:11:22.547Z Has data issue: false hasContentIssue false
  • English
  • Français

Generic graph construction

Published online by Cambridge University Press:  12 March 2014

James E. Baumgartner
James E. Baumgartner*
Affiliation:
Dartmouth College, Hanover, New Hampshire 03755
Get access Rights & Permissions [Opens in a new window]

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.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 49 , Issue 1 , March 1984 , pp. 234 - 240
Copyright
Copyright © Association for Symbolic Logic 1984

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Erdös, P., Problems and results on finite and infinite combinatorial analysis, Infinite and finite sets (Hajnal, A., Rado, R. and Sós, V. T., editors), vol. I, Colloquia Mathematica Societatis János Bolyai, vol. 10, North-Holland, Amsterdam, 1975, pp. 403–424.Google Scholar
[2]Williams, N. H., Combinatorial set theory, North-Holland, Amsterdam, 1977.Google Scholar