Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-17T05:02:20.748Z Has data issue: false hasContentIssue false

An extremal problem in graph theory II

Part of:Graph theory

Published online by Cambridge University Press:  09 April 2009

H. L. Abbott
Affiliation:
Mathematics Department University of AlbertaEdmonton, CanadaT6G 2G1
M. Katchalski
Affiliation:
Mathematics Department Technion Haifa, Israel
A. C. Liu
Affiliation:
Mathematics Department University of ReginaRegina, CanadaS4S 0A2
Rights & Permissions [Opens in a new window]

Abstract

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.

We contine our study of the following combinatorial problem: What is the largest integer N = N (t, m, p) for which there exists a set of N people satisfying the following conditions: (a) each person speaks t languages, (b) among any m people there are two who speak a common language and (c) at most p speak a common language. We obtain bounds for N(t, m, p) and evaluate N(3, m, p) for all m and infintely many values of p.

MSC classification

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1980