Lower bounds on the number of triangles in a graph.

David C. Fisher

Published in: J. Graph Theory (1989)

Keyphrases

lower bound
small number
upper bound
objective function
computational complexity
np hard
random walk
running times
constant factor