Large cliques in a power-law random graph

Details Large cliques in a power-law random graph Large cliques in a power-law random graph

2009-05-05

arxiv.org/abs/0905.0561v1

Mathematics

Combinatorics

13 pages

Scientific paper

We study the size of the largest clique $\omega(G(n,\alpha))$ in a random graph $G(n,\alpha)$ on $n$ vertices which has power-law degree distribution with exponent $\alpha$. We show that for `flat' degree sequences with $\alpha>2$ whp the largest clique in $G(n,\alpha)$ is of a constant size, while for the heavy tail distribution, when $0<\alpha<2$, $\omega(G(n,\alpha))$ grows as a power of $n$. Moreover, we show that a natural simple algorithm whp finds in $G(n,\alpha)$ a large clique of size $(1+o(1))\omega(G(n,\alpha))$ in polynomial time.

Affiliated with

Also associated with

No associations

Rating

Large cliques in a power-law random graph 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 Large cliques in a power-law random graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Large cliques in a power-law random graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-450464