On a rainbow extremal problem for color-critical graphs

TL;DR

This paper investigates the maximum edge configurations in multi-graph systems that avoid a colorful copy of a color-critical graph, extending previous results and confirming conjectures for certain classes of graphs.

Contribution

It proves the conjecture for 4-color-critical graphs and most r-color-critical graphs when r > 4, and shows the non-extremality of natural constructions for non-color-critical non-bipartite graphs.

Findings

Confirmed the conjecture for 4-color-critical graphs.

Extended results to almost all r-color-critical graphs for r > 4.

Identified cases where natural constructions are not extremal.

Abstract

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 from each $G_i$? A lower bound on $\sum_{i\in [k]} e(G_i)$ enforcing a colorful copy of a given graph $H$ was considered by Keevash, Saks, Sudakov, and Verstra\"{e}te. They defined $\operatorname{ex}_k(n,H)$ to be the maximum total number of edges of the graphs $G_1,\dots, G_k$ on a common vertex set of size $n$ having no colorful copy of $H$. They completely determined $\operatorname{ex}_k(n,K_r)$ for large $n$ by showing that, depending on the value of $k$, one of the two natural constructions is always the extremal construction. Moreover, they conjectured the same holds for every color-critical graphs and proved it for 3-color-critical graphs. We prove their conjecture for 4-color-critical graphs and for almost all $r$-color-critical graphs when $r > 4$. Moreover, we show that for every non-color-critical non-bipartite graphs, none of the two natural constructions is extremal for certain values of $k$. This answers a question of Keevash, Saks, Sudakov, and Verstra\"{e}te.