Boolean Rainbow Ramsey Numbers

• Boolean rainbow Ramsey numbers are extremal parameters that measure when any coloring of the Boolean lattice forces a monochromatic copy of one poset or a rainbow copy of another.
• Exact results for poset pairs such as antichain–antichain and chain–chain provide concrete benchmarks, using thresholds like binomial coefficients and product formulas.
• Combinatorial methods, including symmetric chain decomposition and the Lubell function, are pivotal in establishing upper and lower bounds and guiding further research.

A Boolean rainbow Ramsey number is a Ramsey-type extremal parameter quantifying the interplay between monochromatic and rainbow subposet configurations in the Boolean lattice. Formally, given two finite posets $P$ and $Q$, the Boolean rainbow Ramsey number $\operatorname{RR}(P, Q)$ is the minimal dimension $n$ such that for every coloring of $\mathcal{B}_n = (2^{[n]}, \subseteq)$, one finds either an induced monochromatic copy of $P$ or an induced rainbow copy of $Q$ (Chen et al., 2019, Chen et al., 2021, Katona et al., 31 Jan 2026, Chang et al., 2018). This concept forms the poset-theoretic analogue of classical and rainbow Ramsey theory, naturally extending work of Axenovich, Walzer, Chang, Gerbner, Li, Methuku, Nagy, Patkós, and Vizer.

1. Formalism and Foundational Definitions

Let $P$, $Q$ be finite posets. The Boolean lattice of dimension $n$ is $\mathcal{B}_n$ with elements $2^{[n]}$ and order given by subset inclusion. The $k$th level, $L_k(\mathcal{B}_n)$, is the set of all size-$k$ subsets.

• Coloring: A map $c: 2^{[n]} \to C$, $C$ a color set.
• Monochromatic $P$: An induced copy of $P$ mapped by some order-preserving injection $\phi : P \to 2^{[n]}$ such that all images have the same color.
• Rainbow $Q$: An induced copy of $Q$ mapped by some injection so that all images have different colors.

The Boolean rainbow Ramsey number satisfies

$$\operatorname{RR}(P, Q) = \min \{ n : \text{every coloring}\; c: \mathcal{B}_n \to C \; \text{gives a monochromatic } P \;\text{or rainbow } Q \},$$

where “copy” always means induced unless specified otherwise (cf. “weak” version in (Chang et al., 2018)).

This extremal function admits both “strong” (induced) and “weak” variants:

• $\operatorname{RR}^*(P,Q)$ for induced copies,
• $\operatorname{RR}(P,Q)$ for non-induced (monotone) copies.

Further, the Boolean Gallai-Ramsey number $\operatorname{GR}_k(Q:P)$ restricts to exact $k$-colorings, serving as a refinement for studying coloring structures avoiding prescribed rainbow or monochromatic patterns (Katona et al., 31 Jan 2026).

2. Exact Results in Canonical Poset Classes

For certain pairs $(P,Q)$, exact values for $\operatorname{RR}(P, Q)$ are known (Chen et al., 2019, Chen et al., 2021):

Antichain–antichain:

• Let $A_m$, $A_n$ be $m$- and $n$-element antichains.
• $$N_{m,n} := \min \{ N : \binom{N}{\lfloor N/2 \rfloor} \ge (m-1)(n-1)+1 \}$$.
• Theorem: $\operatorname{RR}(A_m,A_n) = N_{m,n}$.

Chain–chain:

• Let $C_m$, $C_n$ be $m$- and $n$-element chains.
• Theorem: $\operatorname{RR}(C_m,C_n) = (m-1)(n-1)$.

Boolean sublattice–Boolean sublattice:

Let $\mathcal{B}_r$ denote the $r$-dimensional Boolean lattice.

• $$\operatorname{RR}(\mathcal{B}_m, \mathcal{B}_1) = m$$.
• $$\operatorname{RR}(\mathcal{B}_1, \mathcal{B}_n) = 2^n - 1$$.
• $$\operatorname{RR}(\mathcal{B}_2, \mathcal{B}_2) = 6$$.

V-shaped posets–antichains (Chen et al., 2021):

Let $V_{m,n}$ denote the “V-shaped” poset formed from chains of lengths $m+1$ and $n+1$ joined at a single minimum.

• For all $k\ge2$ and $1\le m<n$, $\operatorname{RR}(V_{m,n},A_k) = n(k-1)+2$.

General antichain targets:

In the $k=2$ setting, for any poset $P$ with $|P|\ge 2$, writing $\dim_2(P)$ for the minimal Boolean dimension containing $P$ and $m(P)\in\{0,1,2\}$ for the number of extremal elements,

• $\operatorname{RR}(P, A_2) = \dim_2(P) + m(P)$.

3. General Bounds and Structural Theorems

Upper and lower bounds for $\operatorname{RR}(P,Q)$ leverage poset invariants such as height $h(P)$, width $w(P)$, and Lubell function/induced-Lubell boundedness:

Lower bounds (Chen et al., 2019, Chang et al., 2018):

• $\operatorname{RR}(P, Q) \geq (h(P) - 1)(h(Q) - 1)$,
• $\operatorname{RR}(P,Q) \geq N_{w(P),w(Q)}$,
• Stronger forms incorporating $f(Q)$, the number of extremal elements in $Q$ (Chang et al., 2018).

Upper bounds:

• $$\operatorname{RR}(P, Q) \leq \operatorname{RR}(\mathcal{B}_{\dim_2(P)}, \mathcal{B}_{\dim_2(Q)})$$,
• For Boolean sublattices:

$$\operatorname{RR}(\mathcal{B}_m,\mathcal{B}_n) \leq \sum_{i=1}^{2^n-1} R_i(\mathcal{B}_m)$$

where $R_i(\mathcal{B}_m)$ is the ordinary $i$-color Ramsey number for $\mathcal{B}_m$.

Refinements substantially improve upper bounds for certain pairs. For example, (Katona et al., 31 Jan 2026) gives for $m,n\ge1$:

$$\operatorname{RR}(\mathcal{B}_m:\mathcal{B}_n)\le mR_{2m-1}(\mathcal{B}_n) + m$$

replacing a prior dependence on $\sum_{i=1}^{2m-1}R_i(\mathcal{B}_n)$ from (Chen et al., 2019), thereby reducing the dependence on $m$ from doubly exponential to linear.

Lubell-boundedness:

For uniformly induced Lubell-bounded poset $\mathcal{P}$ and a fixed small pattern (e.g., $V_2$), sharp formulas are achievable:

$$\operatorname{RR}(V_2:\mathcal{P}) = 2e(\mathcal{P}) + 1,$$

where $e(\mathcal{P})$ is the Lubell bound parameter (Katona et al., 31 Jan 2026).

4. Proof Methodologies and Technical Tools

Several combinatorial and extremal techniques underpin modern results:

• Symmetric Chain Decomposition: Essential for antichain results; it partitions $\mathcal{B}_n$ efficiently to facilitate block colorings avoiding forbidden monochromatic/rainbow structures (Chen et al., 2019).
• Pigeonhole Principle: Applied to middle levels or maximal chains to force the emergence of monochromatic or rainbow configurations.
• Principal Chains Construction: Used in rainbow-subposet existence arguments, especially for Boolean sublattices.
• Poset-Splitting via Slices: Exploits two-dimensional slices of $\mathcal{B}_n$ to reduce Ramsey-type arguments to lower dimensions.
• Lubell Mass Methods: The chain-averaging (Lubell function) approach provides thresholds for the existence of rainbow (especially chain or antichain) subposets (Chang et al., 2018, Katona et al., 31 Jan 2026).
• Block-structural Decomposition in Colorings: Exact colorings that avoid small rainbow patterns often admit a rigid block structure (e.g., decomposition by chain or antichain deletion), from which extremal configurations are forced (Katona et al., 31 Jan 2026).

These methods combine to yield sharp constructive colorings below threshold, and counting/averaging techniques above threshold, often leveraging extremal families, forbidden subposet thresholds, and recursive/inductive arguments.

5. Connections, Applications, and Special Cases

Forks, brooms, and small patterns:

• For “fork” $V_r$ (one minimal element plus $r$ incomparable points) and “broom” $A_s$ (one maximal element and $s$ incomparable points), one recovers the general Ramsey numbers:
  • $\operatorname{RR}(P, V_r) = R_r(P)$,
  • $\operatorname{RR}(P, A_s) = R_s(P)$ (Chang et al., 2018).
• These results echo classic Ramsey-type constructions for graphs and hypergraphs, but within poset inclusion structures.

Rainbow chain/antichain extremals:

• Precise extremal functions for the minimal size of color classes needed to force rainbow $A_k$ or $C_k$ are identified (e.g., $F'(n,2)=2\lfloor n/2\rfloor$ or $=2\lfloor n/2\rfloor+2$ when $n$ odd and at least $5$) (Chang et al., 2018).

Lubell mass thresholds:

• Lubell mass $\mathcal{L}_n(F)=\sum_{F\in F}1/\binom{n}{|F|}$ provides analytic control in probabilistic/average sense for extremal families, e.g., the threshold $1+\sqrt{2}$ for rainbow $A_2$ in $2$-colorings (Chang et al., 2018).

Gallai–Ramsey theory for Boolean lattices:

• A strengthened program includes the Gallai–Ramsey numbers $\operatorname{GR}_k(Q:P)$ for exact $k$-colorings, with rigorous structural characterizations for colorings avoiding small rainbow subposets (Katona et al., 31 Jan 2026).

6. Open Questions and Research Directions

Pronounced gaps in current understanding motivate future work:

• Sharp determination of $\operatorname{RR}(A_m,C_n)$: Current gaps—upper $O(mn)$ versus lower $N_{m,2}+n$—remain to be narrowed (Chen et al., 2019).
• The value of $R_k(\mathcal{B}_m)$: Precise growth rates are open, with conjectures in the case $m=2$ that $R_k(\mathcal{B}_2)=(2+o(1))k$; e.g., the case $k=4$ is not settled (Chen et al., 2019).
• Extension to larger or composite poset patterns (diamonds, crowns, $B_3$) in both Gallai–Ramsey and rainbow Ramsey regimes (Katona et al., 31 Jan 2026).
• Refinement of block-structural decompositions to yield exact (rather than asymptotic) thresholds for $\operatorname{RR}(\mathcal{B}_m:\mathcal{B}_n)$ (Katona et al., 31 Jan 2026).
• Complete resolution for the Chang–Gerbner–Li–Methuku–Nagy–Patkós–Vizer question on uniformly induced Lubell-bounded posets $\mathcal{P}$ for general patterns $Q$ (Katona et al., 31 Jan 2026).

7. Summary Table of Principal Values

Below is a table of principal Boolean rainbow Ramsey numbers for canonical poset pairs, extracted from the established results:

Pair $(P, Q)$	$\operatorname{RR}(P, Q)$	Source
$(A_m, A_n)$	$$N_{m,n} = \min \{N : \binom{N}{\lfloor N/2\rfloor} \geq (m-1)(n-1)+1\}$$	(Chen et al., 2019)
$(C_m, C_n)$	$(m-1)(n-1)$	(Chen et al., 2019)
$(\mathcal{B}_m, \mathcal{B}_1)$	$m$	(Chen et al., 2019)
$(\mathcal{B}_1, \mathcal{B}_n)$	$2^n - 1$	(Chen et al., 2019)
$(\mathcal{B}_2, \mathcal{B}_2)$	$6$	(Chen et al., 2019)
$(V_{m,n}, A_k)$	$n(k-1)+2$	(Chen et al., 2021)
$(P, A_2)$ ($|P|\ge2$)	$\dim_2(P) + m(P)$	(Chen et al., 2021)

Advancements continue to refine the structure of colorings in the Boolean lattice and establish connections to Lubell mass, poset parameters, and extremal set theory. The Boolean rainbow Ramsey number consolidates these developments in the intersection of combinatorics, poset theory, and Ramsey theory (Chen et al., 2019, Chen et al., 2021, Katona et al., 31 Jan 2026, Chang et al., 2018).