A strongly non-Ramsey order type

Abstract

It is consistent that there is an order type θ for which\(\psi \not \to [\theta ]_{\aleph _1 }^2\) holds for every type ψ.

This is a preview of subscription content, access via your institution.

References

  1. [1]

    P. Erdős, A. Hajnal, A. Máté, R. Rado:Combinatorial Set Theory: Partition Relation for Cardinals, Studies in Logic,106, North-Holland, 1984.

  2. [2]

    S. Shelah: Can you take Solovay's inaccessible away?Israel Journal of Mathematics,48 (1984), 1–47.

    Google Scholar 

  3. [3]

    S. Shelah: Consistency of positive partition theorems for graphs and models,Set theory and applications, (J. Steprāns, S. Watson, eds), Springer Lect. Notes1401, 167–193.

Download references

Author information

Affiliations

Authors

Additional information

Research partially supported by Hungarian National Science Grant OTKA 016391.

Partially supported by the European Communities (Cooperation in Science and Technology with Central and Eastern European Countries) contract number ERBCIPACT930113.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Hajnal, A., Komjáth, P. A strongly non-Ramsey order type. Combinatorica 17, 363–367 (1997). https://doi.org/10.1007/BF01215918

Download citation

Mathematics Subject Classification (1991)

  • 03E05
  • 04A20
  • 03E35