Graphs without rainbow triangles
arXiv:2203.07768
Abstract
Let F,G,H be three graphs on the same n vertices. We consider the maximum of the sum and product of the number of their edges subject to the condition in the title.
arXiv:2203.07768
Let F,G,H be three graphs on the same n vertices. We consider the maximum of the sum and product of the number of their edges subject to the condition in the title.