Hostname: page-component-78c5997874-4rdpn Total loading time: 0 Render date: 2024-11-14T09:08:54.475Z Has data issue: false hasContentIssue false
  • English
  • Français

There are 2ℵα Friendship Graphs of Cardinal ℵα

Published online by Cambridge University Press:  20 November 2018

Václav Chvátal ,
Anton Kotzig ,
Ivo G. Rosenberg  and
Roy O. Davies
Václav Chvátal
Affiliation:
Centre De Recherches Mathématiques, Université De Montréal
Anton Kotzig
Affiliation:
Centre De Recherches Mathématiques, Université De Montréal
Ivo G. Rosenberg
Affiliation:
Départment of Mathematics, Leicester University
Roy O. Davies
Affiliation:
Départment of Mathematics, Leicester University
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

A friendship graph is a graph in which every two distinct vertices have exactly one common neighbour. Finite friendship graphs were characterized by Erdös, Rényi, and Sós [1] as those for which the vertices can be enumerated as u, υ1,…υk, w1,…wk in such a way that the only edges are uυiuwi and υiwi (i = 1,…,k). Thus finite friendship graphs are rather rare. In contrast, we shall show that there are as many nonisomorphic friendship graphs of given infinite cardinal as there are nonisomorphic graphs of that cardinal altogether. In fact, we do a little more.

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 19 , Issue 4 , 01 December 1976 , pp. 431 - 433
Copyright
Copyright © Canadian Mathematical Society 1976

References

1. Erdös, P., Rényi, A., and Sós, V. T., On a problem of graph theory, Studia Sci. Math. Hung. 1 (1966), 215–235.Google Scholar
2. Chvátal, V. and Kotzig, A., On countable friendship graphs, Publications du CRM-415 (May 1974).Google Scholar
3. Erdös, P. and Hajnal, A., On chromatic number of graphs and set-systems, Acta Math. Hung. 17 (1966), 61–99.Google Scholar
4. Hedrlín, Z., On endomorphisms of graphs and their homomorphic images, pp. 73–83 in Proof Techniques in Graph Theory, New York-London, 1969.Google Scholar
5. Mendelsohn, E., On a technique for representing semigroups as endomorphism semigroups of graphs with given properties, Semigroup Forum 4 (1972), 283–294.Google Scholar
6. Erdös, P., Graph theory and probability, I., Canadian J. Math. 11 (1959), 34–38.Google Scholar