Rainbow Ramsey Problems for the Boolean Lattice

Fei-Huang Chang; Dániel Gerbner; W. Li; Abhishek Methuku; Dániel T. Nagy; Balázs Patkós; Máté Vizer

doi:10.1007/s11083-021-09581-4

ScienceGate Book Chapters

JOURNAL ARTICLE

Rainbow Ramsey Problems for the Boolean Lattice

Fei-Huang Chang Dániel Gerbner W. Li Abhishek Methuku Dániel T. Nagy Balázs Patkós Máté Vizer

Year: 2021 Journal: Order Vol: 39 (3)Pages: 453-463 Publisher: Springer Science+Business Media

DOI: 10.1007/s11083-021-09581-4

Get Full-Text PDF Get Analytical Report

Abstract

Abstract 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 B n 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.

Keywords:

Rainbow Combinatorics Monochromatic color Mathematics Ramsey theory Lattice (music) Discrete mathematics Physics Quantum mechanics

Metrics

Cited By

2.81

FWCI (Field Weighted Citation Impact)

Refs

0.93

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Limits and Structures in Graph Theory

Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics

Advanced Topology and Set Theory

Physical Sciences → Mathematics → Geometry and Topology

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Rainbow Ramsey Problems for the Boolean Lattice

Abstract

Metrics

Citation History

Topics

Related Documents

The Boolean Rainbow Ramsey Number of Antichains, Boolean Posets and Chains

The Boolean Rainbow Ramsey Number of Antichains, Boolean Posets and Chains

The Boolean Rainbow Ramsey Number of Antichains, Boolean Posets and Chains

Ramsey properties for V-shaped posets in the Boolean lattice

Poset Ramsey numbers: large Boolean lattice versus a fixed poset