The minimum number of 4-cliques in graphs with triangle-free complement
Combinatorics
2007-05-23 v1
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.
Keywords
Cite
@article{arxiv.math/0501211,
title = {The minimum number of 4-cliques in graphs with triangle-free complement},
author = {Vladimir Nikiforov},
journal= {arXiv preprint arXiv:math/0501211},
year = {2007}
}
Comments
8 pages