Login / Signup
Random cubic graphs are not homomorphic to the cycle of size 7.
Hamed Hatami
Published in:
J. Comb. Theory, Ser. B (2005)
Keyphrases
</>
maximal cliques
graph theoretic
uniform random
privacy preserving
uniformly distributed
graph theory
weighted graph
pruning power
random sample
small size
graph representation
graph databases
neural network
graph structure
graph matching
b spline
knn
pairwise
bayesian networks