Large cliques in a power-law random graph
| dc.creator | Janson, Svante | |
| dc.creator | Łuczak, Tomasz | |
| dc.creator | Norros, Ilkka | |
| dc.date | 2009-05-05 | |
| dc.date.accessioned | 2026-07-07T13:11:51Z | |
| dc.date.available | 2026-07-07T13:11:51Z | |
| dc.description | We study the size of the largest clique $ω(G(n,α))$ in a random graph $G(n,α)$ on $n$ vertices which has power-law degree distribution with exponent $α$. We show that for `flat' degree sequences with $α>2$ whp the largest clique in $G(n,α)$ is of a constant size, while for the heavy tail distribution, when $0<α<2$, $ω(G(n,α))$ grows as a power of $n$. Moreover, we show that a natural simple algorithm whp finds in $G(n,α)$ a large clique of size $(1+o(1))ω(G(n,α))$ in polynomial time. | |
| dc.description | 13 pages | |
| dc.identifier | https://arxiv.org/abs/0905.0561 | |
| dc.identifier | http://arxiv.org/abs/0905.0561 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/229417 | |
| dc.subject | Combinatorics | |
| dc.subject | Probability | |
| dc.subject | 05C80; 05C69, 60C05 | |
| dc.title | Large cliques in a power-law random graph | |
| dc.type | text |