Author:
Abbott H. L.,Katchalski M.,Liu A. C.
Abstract
AbstractWe 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.
Publisher
Cambridge University Press (CUP)
Reference2 articles.
1. Abbott H. L. , Hanson D. and Liu A. C. , ‘An extremal problem in graph theory’, Quart. J. Math. Oxford Ser. (to appear).
2. Disjoint triples in a 3-graph with given maximal degree;Béla;Quart. J. Math. Oxford Ser.,1977
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Intersecting designs from linear programming and graphs of diameter two;Discrete Mathematics;1994-03
2. On r-graphs and r-multihypergraphs with given maximum degree;Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics;1991-04
3. Covering pairs by q2 + q + 1 sets;Journal of Combinatorial Theory, Series A;1990-07
4. Matchings and covers in hypergraphs;Graphs and Combinatorics;1988-12