Diverse homogeneous sets
dc.contributor.author | Blass, Andreas | en_US |
dc.contributor.author | Erdos, Paul | en_US |
dc.contributor.author | Taylor, Alan | en_US |
dc.date.accessioned | 2006-04-10T15:19:07Z | |
dc.date.available | 2006-04-10T15:19:07Z | |
dc.date.issued | 1992-03 | en_US |
dc.identifier.citation | Blass, Andreas, Erdos, Paul, Taylor, Alan (1992/03)."Diverse homogeneous sets." Journal of Combinatorial Theory, Series A 59(2): 312-317. <http://hdl.handle.net/2027.42/30188> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B6WHS-4D8DPVM-5J/2/102e6e0ecba0b123323494374a2ea6b2 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/30188 | |
dc.description.abstract | A set H [subset of or equal to] [omega] is said to be diverse with respect to a partition [Pi] of [omega] if at least two pieces of [Pi] have an infinite intersection with H. A family of partitions of [omega] has the Ramsey property if, whenever [[omega]]2 is two-colored, some monochromatic set is diverse with respect to at least one partition in the family. We show that no countable collection of even infinite partitions of [omega] has the Ramsey property, but there always exists a collection of 1 finite partitions of [omega] with the Ramsey property. | en_US |
dc.format.extent | 313517 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | en_US |
dc.title | Diverse homogeneous sets | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Mathematics Department, University of Michigan, Ann Arbor, Michigan 48109, USA | en_US |
dc.contributor.affiliationother | Mathematical Institute, Hungarian Academy of Sciences, Reáltanoda u. 13-15, Budapest, H-1053, Hungary | en_US |
dc.contributor.affiliationother | Mathematics Department, Union College, Schenectady, New York 12308, USA | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/30188/1/0000573.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/0097-3165(92)90072-3 | en_US |
dc.identifier.source | Journal of Combinatorial Theory, Series A | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.