Abstract
AbstractWe address the following rainbow Ramsey problem: For posets P, Q what is the smallest number n such that any coloring of the elements of the Boolean lattice Bn either admits a monochromatic copy of P or a rainbow copy of Q. We consider both weak and strong (non-induced and induced) versions of this problem.
Funder
Nemzeti Kutatási Fejlesztési és Innovációs Hivatal
Magyar Tudományos Akadémia
Ministry of Science and Technology, Taiwan
ELKH Alfréd Rényi Institute of Mathematics
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Geometry and Topology,Algebra and Number Theory
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献