Related papers: Rainbow Tur\'an problems for forbidden subposets

Given an edge-colored graph, the Maximum Rainbow Matching problem asks for a maximum-cardinality matching of the graph that contains at most one edge from each color. We provide the following complexity dichotomy for this problem based on…

For $n \geq k \geq 4$, let $AR_{X + Y = Z + T}^k (n)$ be the maximum number of rainbow solutions to the Sidon equation $X+Y = Z + T$ over all $k$-colorings $c:[n] \rightarrow [k]$. It can be shown that the total number of solutions in $[n]$…

In this paper we show a variant of colorful Tverberg's theorem which is valid in any matroid: Let $S$ be a sequence of non-loops in a matroid $M$ of finite rank $m$ with closure operator cl. Suppose that $S$ is colored in such a way that…

Aharoni and Berger conjectured that every bipartite graph which is the union of n matchings of size n + 1 contains a rainbow matching of size n. This conjecture is a generalization of several old conjectures of Ryser, Brualdi, and Stein…

Given a graph $H$ and a family of graphs $\mathcal{F}$, the generalized Tur\'an number $\mathrm{ex}(n,H,\mathcal{F})$ is the maximum number of copies of $H$ in an $n$-vertex graphs that do not contain any member of $\mathcal{F}$ as a…

We say that a poset $(Q,\le_{Q})$ contains an induced copy of a poset $(P,\le_P)$ if there is an injective function $\phi\colon P\to Q$ such that for every two $X,Y\in P$,\;\;$X\le_P Y$ if and only if $\phi(X)\le_Q \phi(Y)$. We denote the…

There has been extensive studies on the following question: given $k$ graphs $G_1,\dots, G_k$ over a common vertex set of size $n$, what conditions on $G_i$ ensures a `colorful' copy of $H$, i.e., a copy of $H$ containing at most one edge…

Given two finite posets $\mathcal P$ and $\mathcal Q$, their Ramsey number, denoted by $R(\mathcal P,\mathcal Q)$, is defined to be the smallest integer $N$ such that any blue/red colouring of the vertices of the hypercube $Q_N$ has either…

Extremal problems on set systems with restricted intersections have been an important part of combinatorics in the last 70 year. In this paper, we study the following Ramsey version of these problems. Given a set $L\subseteq…

Considering a natural generalization of the Ruzsa-Szemer\'edi problem, we prove that for any fixed positive integers $r,s$ with $r<s$, there are graphs on $n$ vertices containing $n^{r}e^{-O(\sqrt{\log{n}})}=n^{r-o(1)}$ copies of $K_s$ such…

We prove that, for any finite set of minimal $r$-graph patterns, there is a finite family $\mathcal F$ of forbidden $r$-graphs such that the extremal Tur\'an constructions for $\mathcal F$ are precisely the maximum $r$-graphs obtainable…

Let $\mathcal{Q}_n$ be the $n$-dimensional hypercube: the graph with vertex set $\{0,1\}^n$ and edges between vertices that differ in exactly one coordinate. For $1\leq d\leq n$ and $F\subseteq \{0,1\}^d$ we say that $S\subseteq \{0,1\}^n$…

For two graphs $G$ and $H$, write $G \stackrel{\mathrm{rbw}}{\longrightarrow} H$ if $G$ has the property that every {\sl proper} colouring of its edges yields a {\sl rainbow} copy of $H$. We study the thresholds for such so-called {\sl…

A family $\mbox{$\cal F$}=\{F_1,\ldots,F_m\}$ of subsets of $[n]$ is said to be ordered, if there exists an $1\leq r\leq m$ index such that $n\in F_i$ for each $1\leq i\leq r$, $n\notin F_i$ for each $i>r$ and $|F_i|\leq |F_j|$ for each…

The Graph Motif problem was introduced in 2006 in the context of biological networks. It consists of deciding whether or not a multiset of colors occurs in a connected subgraph of a vertex-colored graph. Graph Motif has been mostly analyzed…

An ordered graph $H$ is a simple graph with a linear order on its vertex set. The corresponding Tur\'an problem, first studied by Pach and Tardos, asks for the maximum number $\text{ex}_<(n,H)$ of edges in an ordered graph on $n$ vertices…

Given a graph $H$, we say a graph $G$ is properly rainbow $H$-saturated if there is a proper edge-coloring of $G$ which contains no rainbow copy of $H$, but adding any edge to $G$ makes such an edge-coloring impossible. The proper rainbow…

As a variant of the much studied Tur\'an number, $ex(n,F)$, the largest number of edges that an $n$-vertex $F$-free graph may contain, we introduce the connected Tur\'an number $ex_c(n,F)$, the largest number of edges that an $n$-vertex…

In this paper, we investigate the following Gallai-Ramsey question: how large must a complete bipartite graph $K_{n_1, n_2}$ be before any coloring of its edges with $r$ colors contains either a monochromatic copy of $G = K_{s,t}$ or a…

A Boolean lattice $\mathcal{B}_n=(2^X, \leq)$ is the power set of an $n$-element ground set $X$ equipped with inclusion relation. For two posets $\mathcal{P}$ and $\mathcal{Q}$, we say that $\mathcal{Q}$ contains an \emph{induced copy} of…