Show simple item record

Diverse homogeneous sets

dc.contributor.authorBlass, Andreasen_US
dc.contributor.authorErdos, Paulen_US
dc.contributor.authorTaylor, Alanen_US
dc.date.accessioned2006-04-10T15:19:07Z
dc.date.available2006-04-10T15:19:07Z
dc.date.issued1992-03en_US
dc.identifier.citationBlass, 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.urihttp://www.sciencedirect.com/science/article/B6WHS-4D8DPVM-5J/2/102e6e0ecba0b123323494374a2ea6b2en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/30188
dc.description.abstractA 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.extent313517 bytes
dc.format.extent3118 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherElsevieren_US
dc.titleDiverse homogeneous setsen_US
dc.typeArticleen_US
dc.rights.robotsIndexNoFollowen_US
dc.subject.hlbsecondlevelMathematicsen_US
dc.subject.hlbtoplevelScienceen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumMathematics Department, University of Michigan, Ann Arbor, Michigan 48109, USAen_US
dc.contributor.affiliationotherMathematical Institute, Hungarian Academy of Sciences, Reáltanoda u. 13-15, Budapest, H-1053, Hungaryen_US
dc.contributor.affiliationotherMathematics Department, Union College, Schenectady, New York 12308, USAen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/30188/1/0000573.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1016/0097-3165(92)90072-3en_US
dc.identifier.sourceJournal of Combinatorial Theory, Series Aen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Show simple item record

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.