Balázs Patkós

Maximal anti-Ramsey problems for posets

We study the forbidden poset analog of the maximal anti-Ramsey problem introduced for graphs by Burr, Erd\H os, Graham, and S\'os. For integers $m\le 2^n$ and poset $P=(P,\preceq)$, we introduce $\mathrm{ar_m}(n,m,P)$ (and $\mathrm{ar^*_m}(n,m,P)$) to denote the minimum integer $k$ such that there exists a family $\mat...