Please use this identifier to cite or link to this item: https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/7602
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGregory L. Mccolm-
dc.date.accessioned2024-02-27T06:20:29Z-
dc.date.available2024-02-27T06:20:29Z-
dc.date.issued2003-
dc.identifier.urihttp://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/7602-
dc.description.abstractIt is known that if P and Q are posets and * is lexicographic product, then (in t he Erdos-Rado partition notation) , P*Q ? (P, Q) . It is known that if Sand Tare trees of r ank at most w, and " x" is Cartesian product, then S x T ? (S, T).-
dc.publisherBulletin of the Institute of Combinatorics and Its Applications-
dc.titleAn Anti-Ramsey Theorem on Posets-
dc.volVol 38-
Appears in Collections:Articles to be qced

Files in This Item:
File SizeFormat 
An Anti-Ramsey Theorem on Posets.pdf4.04 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.