The minimum number of triangular edges and a symmetrization method for multiple graphs
classification
🧮 math.CO
keywords
edgesgraphsmethodminimumnumbersymmetrizationappliedasymptotic
read the original 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.
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.