On a rainbow extremal problem for color‐critical graphs

• Published in: Random structures & algorithms Vol. 64; no. 2; pp. 460 - 489
• Main Authors: Chakraborti, Debsoumya, Kim, Jaehoon, Lee, Hyunwoo, Liu, Hong, Seo, Jaehyeon
• Format: Journal Article
• Language: English
• Published: New York John Wiley & Sons, Inc 01.03.2024; Wiley Subscription Services, Inc
• Subjects: Color; color‐critical graphs; Graphs; rainbow extremal problem; Vertex sets

Given k$$ k $$ graphs G1,…,Gk$$ {G}_1,\dots, {G}_k $$ over a common vertex set of size n$$ n $$, what is the maximum value of ∑i∈[k]e(Gi)$$ {\sum}_{i\in \left[k\right]}e\left({G}_i\right) $$ having no “colorful” copy of H$$ H $$, that is, a copy of H$$ H $$ containing at most one edge from each Gi$$...