Rainbow triangles in families of triangles

arXiv2209.15493MaRDI QIDQ6412486FDOQ6412486

Ido Goorevitch, Ron Holzman

Publication date: 30 September 2022

Abstract: We prove that a family $mathcalT$ of distinct triangles on $n$ given vertices that does not have a rainbow triangle (that is, three edges, each taken from a different triangle in $mathcalT$, that form together a triangle) must be of size at most $frac{n}^{2}8$. We also show that this result is sharp and characterize the extremal case. In addition, we discuss a version of this problem in which the triangles are not necessarily distinct, and show that in this case, the same bound holds asymptotically. After posting the original arXiv version of this paper, we learned that the sharp upper bound of $frac{n}^{2}8$ was proved much earlier by GyH{o}ri (2006) and independently by Frankl, F"uredi and Simonyi (unpublished). GyH{o}ri also obtained a stronger version of our result for the case when repetitions are allowed.

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

This page was built for publication: Rainbow triangles in families of triangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6412486)