The Erdős-Hajnal problem list

Bulletin of Symbolic Logic:1-58 (forthcoming)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1017/bsl.2025.1

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,154

External links

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

Through your library

My notes

Similar books and articles

On a combinatorial principle of Hajnal and komjáth.Dan Velleman - 1986 - Journal of Symbolic Logic 51 (4):1056-1060.
[Omnibus Review].James E. Baumgartner - 1985 - Journal of Symbolic Logic 50 (1):239-240.
omnibus Review. [REVIEW]James Baumgartner - 1995 - Journal of Symbolic Logic 60 (2):698-701.
Review: P. Erdos, A. Hajnal, On the Structure of Set-Mappings; P. Erdos, A. Hajnal, Some Remarks Concerning Our Paper "On the Structure of Set-Mappings".-- Non Existence of a two-valued $sigma$-measure for the first uncountable inaccessible cardinal. [REVIEW]W. N. Reinhardt - 1973 - Journal of Symbolic Logic 38 (1):152-153.
Independence of strong partition relation for small cardinals, and the free-subset problem.Saharon Shelah - 1980 - Journal of Symbolic Logic 45 (3):505-509.
Hanf W.. On a problem of Erdös and Tarski. Fundamenta mathematicae, vol. 53 no. 3 , pp. 325–334.Monk D. and Scott D.. Additions to some results of Erdös and Tarski. Fundamenta mathematicae, vol. 53 no. 3 , pp. 335–343.Hajnal A.. Remarks on the theory of W. P. Hanf. Fundamenta mathematicae vol. 54 no. 1 , pp. 109–113. [REVIEW]Jean A. Larson - 1974 - Journal of Symbolic Logic 39 (2):332-332.
A Theory of Stationary Trees and the Balanced Baumgartner–Hajnal–Todorcevic Theorem for Trees.Ari Meir Brodsky - 2019 - Bulletin of Symbolic Logic 25 (2):219-219.
James E. Baumgartner. Generic graph construction. The journal of symbolic logic, vol. 49 , pp. 234–240. - Matthew Foreman and Richard Laver. Some downwards transfer properties for ℵ2. Advances in mathematics, vol. 67 , pp. 230–238. - Saharon Shelah. Incompactness for chromatic numbers of graphs. A tribute to Paul Erdős, edited by A. Baker, B. Bollobas, and A. Hajnal, Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1990, pp. 361–371. [REVIEW]Péter Komjáth - 2001 - Bulletin of Symbolic Logic 7 (4):539-541.

Analytics

Added to PP
2025-01-07

Downloads
4 (#1,797,832)

6 months
4 (#1,232,709)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references