Author Thread
Post actions #1
I think this would be rather interesting to see what people come up with.
Post actions #2
Post actions #3
Originally posted by Cory:
Post actions #4
Post actions #5
Post actions #6
Ok -- I have to read more carefully -- I read it homophobes, which really seemed like a strange challenge suggestion....
Post actions #7
Originally posted by vawendy:
Ok -- I have to read more carefully -- I read it homophobes, which really seemed like a strange challenge suggestion....
Post actions #8
Good lord guys, i knew this would be misread *facepalm*
Post actions #9
Originally posted by shadow-d:
Good lord guys, i knew this would be misread *facepalm*
Post actions #10
Originally posted by Cory:
Originally posted by shadow-d:
Good lord guys, i knew this would be misread *facepalm*
Post actions #11
I miss-read as well...but I think it has already been pointed out
Post actions #12
Originally posted by shadow-d:
Good lord guys, i knew this would be misread *facepalm*
Post actions #13
Message edited by author 2013-05-20 15:46:28.
Post actions #14
Originally posted by Spork99:
Originally posted by shadow-d:
Good lord guys, i knew this would be misread *facepalm*
Post actions #15
Originally posted by shadow-d:
Originally posted by Spork99:
Originally posted by shadow-d:
Good lord guys, i knew this would be misread *facepalm*
Post actions #16
Originally posted by shadow-d:
Good lord guys, i knew this would be misread *facepalm*
some of us pay attention to what we're reading ...
Post actions #17
Post actions #18
Originally posted by shadow-d:
Am I the youngest here?
Post actions #19
Originally posted by shadow-d:
Am I the youngest here?
Post actions #20
Originally posted by cowboy221977:
Originally posted by shadow-d:
Am I the youngest here?
Post actions #21
A graph homomorphism from a graph G to another graph H is a function f which maps vertices of G to vertices of H, and does so in such a way that if u and v are adjacent in G then f(u) and f(v) are adjacent in H. Note that graph homomorphism is different from graph isomorphism. For instance, it's relatively trivial to find a graph homomorphism from C_5 (cycle of length 5) to C_3. But the two are not isomorphic.
Post actions #22
what is this f(u) blasphemy?
Post actions #23
