On Erdös's Conjecture on Multiplicities of Complete Subgraphs Lower Upper Bound for Cliques of Size 6.

Frantisek Franek

Published in: Comb. (2002)

Keyphrases

upper bound
maximum clique
maximal cliques
branch and bound algorithm
lower bound
data structure
worst case
linear combination
branch and bound
association graph
space complexity
constant factor
neural network
graph theory
small size
fully connected
bayesian networks
data mining