Cliques in graphs with bounded minimum degree

Details Cliques in graphs with bounded minimum degree Cliques in graphs with bounded minimum degree

2010-09-27

arxiv.org/abs/1009.5296v1

Mathematics

Combinatorics

30 pages

Scientific paper

Let $k_r(n,\delta)$ be the minimum number of $r$-cliques in graphs with $n$
vertices and minimum degree $\delta$. We evaluate $k_r(n,\delta)$ for $\delta
\leq 4n/5$ and some other cases. Moreover, we give a construction, which we
conjecture to give all extremal graphs (subject to certain conditions on $n$,
$\delta$ and $r$).

Affiliated with

Also associated with

No associations

Rating

Cliques in graphs with bounded minimum degree 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 Cliques in graphs with bounded minimum degree, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cliques in graphs with bounded minimum degree will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-518377