pith. sign in

arxiv: 2203.07768 · v1 · pith:YMJALBFQnew · submitted 2022-03-15 · 🧮 math.CO

Graphs without rainbow triangles

Peter Frankl This is my paper
classification 🧮 math.CO
keywords graphsconditionconsideredgesmaximumnumberproductrainbow
0
0 comments X
read the original 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 paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Transversal Structures in Graph Systems: A Survey

    math.CO 2024-12 unverdicted novelty 2.0

    Survey compiling sufficient conditions for transversal m-edge structures in graph systems that extend classical extremal graph theory results, plus conjectures.