Please use this identifier to cite or link to this item:
https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/7602
Title: | An Anti-Ramsey Theorem on Posets |
Authors: | Gregory L. Mccolm |
Issue Date: | 2003 |
Publisher: | Bulletin of the Institute of Combinatorics and Its Applications |
Abstract: | It 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). In this article we exhibit pairs of finite posets P and Q such that P x Q I+ (P, Q). In particular, we prove t hat if Bn is the poset of the power set on n elements, t hen for each integer a, > 1, t here exists N such t hat n > N implies B n+o f+ (Bn , B0 ) ; indeed, we can choose n such that B n+o f+ (En, B2). We conclude by looking at a few positive results. |
URI: | http://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/7602 |
Appears in Collections: | Articles to be qced |
Files in This Item:
File | Size | Format | |
---|---|---|---|
An Anti-Ramsey Theorem on Posets.pdf | 4.04 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.