Graphs without rainbow triangles
From MaRDI portal
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.
This page was built for publication: Graphs without rainbow triangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6393734)
