On a rainbow extremal problem for color‐critical graphs

DOI10.1002/rsa.21189arXiv2204.02575OpenAlexW4387741525MaRDI QIDQ6119226

Jae-Hoon Kim, Hong Liu, Debsoumya Chakraborti, Hyun-Woo Lee, Jaehyeon Seo

Publication date: 29 February 2024

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2204.02575

zbMATH Keywords

color-critical graphsrainbow extremal problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A topological colorful Helly theorem
• A generalization of Caratheodory's theorem
• Stability results for graphs with a critical edge
• Multicolour Turán problems
• On a rainbow version of Dirac's theorem
• A rainbow version of Mantel's Theorem
• A Rainbow r-Partite Version of the Erdős–Ko–Rado Theorem
• On the theory of graphs
• Transversal factors and spanning trees

This page was built for publication: On a rainbow extremal problem for color‐critical graphs