Graphs without rainbow triangles
Combinatorics
2022-03-16 v1
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.
Keywords
Cite
@article{arxiv.2203.07768,
title = {Graphs without rainbow triangles},
author = {Peter Frankl},
journal= {arXiv preprint arXiv:2203.07768},
year = {2022}
}