A Tree-Arrowing Graph

S. Shelah and E. C. Milner
Additional contact information
S. Shelah: Hebrew University
E. C. Milner: University of Calgary

A chapter in Set Theory, 1998, pp 175-182 from Springer

Abstract: 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.

Keywords: Partition relation; graph; tree; cardinal number; stationary set; normal filter; 03; 04 (search for similar items in EconPapers)
Date: 1998
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-015-8988-8_11

Ordering information: This item can be ordered from
http://www.springer.com/9789401589888

DOI: 10.1007/978-94-015-8988-8_11

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().