Author:
Abbott H. L.,Hanson D.,Liu A. C.
Abstract
AbstractLet t, m > 2 and p > 2 be positive integers and denote by N(t, m, p) the largest integer for which there exists a t-uniform hypergraph with N (not necessarily distinct) edges and having no independent set of edges of size m and no vertex of degree exceeding p. In this paper we complete the determination of N(t, m, 3) and obtain some new bounds on N(t, 2, p).
Publisher
Cambridge University Press (CUP)
Subject
General Mathematics,Statistics and Probability
Reference3 articles.
1. [2] Abbott H. L. , Katchalski M. and Liu A. C. , ‘An extremal problem in graph theory II’, J. Austral. Math. Soc., (to appear).
2. An extremal problem in graph theory;Abbott;Quart. J. Math.,1980
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On r-graphs and r-multihypergraphs with given maximum degree;Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics;1991-04
2. Matchings and covers in hypergraphs;Graphs and Combinatorics;1988-12