Graphs without rainbow triangles

preprint2022arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.