Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size.

Jan Dreier Philipp Kuinke Peter Rossmanith

Published in: APPROX-RANDOM (2020)

Keyphrases

preferential attachment
maximum clique
power laws
maximal cliques
small world
graph theory
graph theoretic
degree distribution
power law distribution
shortest path
scale free
social networks
information extraction
natural language processing
graph mining
random graphs