Skip to main content

A Tree-Arrowing Graph

  • Conference paper
Set Theory
  • 381 Accesses

Abstract

We answer a variant of a question of Rödl and Voigt by showing that, for a given infinite cardinal λ, there is a graph G of cardinality κ = (2λ)+ such that for any colouring of the edges of G with λ colours, there is an induced copy of the κ-tree in G in the set theoretic sense with all edges having the same colour.

Dedicated to the memory of Eric Milner

Paper Sh 578 in Shelah’s publication list. Research supported by “The Israel Science Foundation” administered by The Israel Academy of Sciences and Humanities.

Research supported by NSERC grant #69–0982.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Erdős and R. Rado, A partition calculus in set theory, Bull. Amer. Math. Soc. 62 (1956) 427–489.

    Article  MathSciNet  Google Scholar 

  2. A. Hajnal and P. Komjath, Embedding graphs into colored graphs, Trans. Amer. Math. Soc. 307 (1988), 395–409; Corrigendum: 332 (1992), 475.

    Article  MathSciNet  MATH  Google Scholar 

  3. P. Komjath and E.C. Milner, On a conjecture of Rödl and Voigt. J. Combin. Theory, Ser. B 61 (1994), 199–209.

    Article  MathSciNet  MATH  Google Scholar 

  4. V. Rödl and B. Voigt, Monochromatic trees with respect to edge partitions, J. Combin. Theory Ser. B 58 (1993), 291–298.

    Article  MathSciNet  MATH  Google Scholar 

  5. Saharon Shelah [Sh: 289], Consistency of positive partition theorems for graphs and models, in: Set theory and its applications (Toronto, ON, 1987), Lecture Notes in Mathematics 1401, (J. Steprans and S. Watson, eds.), Springer, Berlin-New York, (1989) 167–193.

    Chapter  Google Scholar 

  6. Saharon Shelah [Sh: 365], There are Jonsson algebras in many inaccessible cardinals, in: Cardinal Arithmetic, Oxford Logic Guides 29 chapter III, Oxford University Press, 1994.

    Google Scholar 

  7. Saharon Shelah [Sh: 413], More Jonsson Algebras and Colourings, Archive for Mathematical Logic, to appear.

    Google Scholar 

  8. Saharon Shelah [Sh: 572], Colouring and ℵ2-cc not productive, Annals of Pure and Applied Logic, 84 (1997), 153–174.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer Science+Business Media Dordrecht

About this paper

Cite this paper

Shelah, S., Milner, E.C. (1998). A Tree-Arrowing Graph. In: Di Prisco, C.A., Larson, J.A., Bagaria, J., Mathias, A.R.D. (eds) Set Theory. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-8988-8_11

Download citation

  • DOI: https://doi.org/10.1007/978-94-015-8988-8_11

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-4978-0

  • Online ISBN: 978-94-015-8988-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics