By Thomas Bläsius and others

We investigate the number of maximal cliques, i.e., cliques that are not contained in any larger clique, in three network models: Erd\H{o}s-R\'enyi random graphs, inhomogeneous random graphs (also called Chung-Lu graphs), and geometric inhomogeneous random graphs. For sparse and not-too-dense Erd\H{o}s-R\'enyi graphs, we give linear and polynomial upper bounds on... Show more

September 4, 2024

Loading full text...

Similar articles

Loading recommendations...

x1

Maximal Cliques in Scale-Free Random Graphs

Click on play to start listening