Minimum Number of k-Cliques in Graphs with Bounded Independence Number

Details Minimum Number of k-Cliques in Graphs with Bounded Independence Number Minimum Number of k-Cliques in Graphs with Bounded Independence Number

2012-03-20

arxiv.org/abs/1203.4393v1

Mathematics

Combinatorics

19 pages

Scientific paper

Erdos asked about the value of f(n,k,l), the minimum number of k-cliques in a
graph of order n and independence number less than l. The case (k,l)=(3,3) was
solved by Lorden. Here we solve the problem when n is large and (k,l) is (3,4),
(4,3), (5,3), (6,3), or (7,3). Independently, Das, Huang, Ma, Naves, and
Sudakov solved the cases (k,l)=(3,4) or (4,3) when n is large.

Affiliated with

Also associated with

No associations

Rating

Minimum Number of k-Cliques in Graphs with Bounded Independence Number 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 Minimum Number of k-Cliques in Graphs with Bounded Independence Number, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimum Number of k-Cliques in Graphs with Bounded Independence Number will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-494604