Directed graphs without rainbow triangles
arXiv (Cornell University)(2023)
摘要
One of the most fundamental results in graph theory is Mantel's theorem which determines the maximum number of edges in a triangle-free graph of order $n$. Recently a colorful variant of this problem has been solved. In such a variant we consider $c$ graphs on a common vertex set, thinking of each graph as edges in a distinct color, and want to determine the smallest number of edges in each color which guarantees existence of a rainbow triangle. Here, we solve the analogous problem for directed graphs without rainbow triangles, either directed or transitive, for any number of colors. The constructions and proofs essentially differ for $c=3$ and $c \geq 4$ and the type of the forbidden triangle. Additionally, we also solve the analogous problem in the setting of oriented graphs.
更多查看译文
关键词
rainbow triangles,graphs
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要