Article contents
An extremal problem in graph theory II
Published online by Cambridge University Press: 09 April 2009
Abstract
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
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 1980
References
- 4
- Cited by