We prove new lower bounds on the modularity of graphs. Specifically, the...
Random graph models with community structure have been studied extensive...
Suppose that there is an unknown underlying graph G on a large vertex se...
A tournament H is quasirandom-forcing if the following holds for every
s...
The maximum modularity of a graph is a parameter widely used to describe...
share