Autor:	Fei-Huang Chang, Dániel Gerbner, Wei-Tian Li, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Máté Vizer
Jazyk:	angličtina
Rok vydání:	2018
Předmět:	Mathematics::Logic Algebra and Number Theory Mathematics::Combinatorics Computational Theory and Mathematics Computer Science::Discrete Mathematics FOS: Mathematics Mathematics - Combinatorics Combinatorics (math.CO) Geometry and Topology
Popis:	We 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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c6f04cbde56160eab75486bf9ba597ba http://arxiv.org/abs/1809.08629 Zobrazit plný text záznamu