The minimum number of triangular edges and a symmetrization method for multiple graphs
Combinatorics
2016-06-07 v2
Abstract
We give an asymptotic formula for the minimum number of edges contained in triangles in a graph having n vertices and e edges. Our main tool is a generalization of Zykov's symmetrization method that can be applied for several graphs simultaneously.
Keywords
Cite
@article{arxiv.1411.0771,
title = {The minimum number of triangular edges and a symmetrization method for multiple graphs},
author = {Zoltán Füredi and Zeinab Maleki},
journal= {arXiv preprint arXiv:1411.0771},
year = {2016}
}
Comments
Same paper, better presentation. Now it has 10 pages with 7 figures