Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-18T15:36:37.333Z Has data issue: false hasContentIssue false

There are 2ℵα Friendship Graphs of Cardinal ℵα

Published online by Cambridge University Press:  20 November 2018

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 , w 1,…w k in such a way that the only edges are uυ i uw i and υ i w i (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.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1976