We give necessary and sufficient conditions for the existence of infinite generalized friendship graphs and show that there are 2° non-isomorphic ones of each admissible order c and chromatic number. Further we prove that such graphs and their complements are almost always regular of degree equal to the order and that various generalizations of the Friendship Theorem do not hold for infinite generalized friendship graphs.
