The minimum number of 4-cliques in graphs with triangle-free complement
classification
🧮 math.CO
keywords
boundcliquescomplementgraphsminimumnumbertriangle-freecase
read the original abstract
Write f(n) for the minimum number of 4-cliques in graphs of order n with triangle-free complement. Finding f(n) is a particular case of a problem raised by Erdos in 1962. We give an upper bound of f(n) and a matching lower bound when the graph is close to regular.
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.