The minimum number of 4-cliques in graphs with triangle-free complement

Details The minimum number of 4-cliques in graphs with triangle-free complement The minimum number of 4-cliques in graphs with triangle-free complement

2005-01-14

arxiv.org/abs/math/0501211v1

Mathematics

Combinatorics

8 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The minimum number of 4-cliques in graphs with triangle-free complement does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The minimum number of 4-cliques in graphs with triangle-free complement, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The minimum number of 4-cliques in graphs with triangle-free complement will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-87951