View Item 

Show simple item record

A graph which embeds all small graphs on any large set of vertices

dc.contributor.authorShelah, Saharonen_US
dc.date.accessioned2006-04-07T20:19:22Z
dc.date.available2006-04-07T20:19:22Z
dc.date.issued1988-05en_US
dc.identifier.citationShelah, S. (1988/05)."A graph which embeds all small graphs on any large set of vertices." Annals of Pure and Applied Logic 38(2): 171-183. <http://hdl.handle.net/2027.42/27309>en_US
dc.identifier.urihttp://www.sciencedirect.com/science/article/B6TYB-45F5R75-V/2/9b75adc4802b5f8b0f17b235dfc6165cen_US
dc.identifier.urihttps://hdl.handle.net/2027.42/27309
dc.description.abstractFor certain cardinals [lambda] and [kappa] a colouring P:[[lambda]]2--&gt;[lambda] is constructed such that if X [epsilon][[lambda]][lambda] and Q:[[kappa]]2--&gt;[lambda], then there is a one-to-one function i:[kappa]--&gt;X such that P(i"A)=Q(A) for every A[epsilon][[kappa]]2. Additional results are obtained.en_US
dc.format.extent2038221 bytes
dc.format.extent3118 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherElsevieren_US
dc.titleA graph which embeds all small graphs on any large set of verticesen_US
dc.typeArticleen_US
dc.rights.robotsIndexNoFollowen_US
dc.subject.hlbsecondlevelMathematicsen_US
dc.subject.hlbtoplevelScienceen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumHebrew University of Jerusalem, Israel and University of Michigan, Ann Arbor, MI, USAen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/27309/1/0000330.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1016/0168-0072(88)90052-8en_US
dc.identifier.sourceAnnals of Pure and Applied Logicen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Name:
0000330.pdf
Size:
1.943MB
Format:
PDF
View/Open

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.