Article contents
An extremal problem in hypergraph theory (II)
Published online by Cambridge University Press: 09 April 2009
Abstract
Let 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).
MSC classification
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 1982
References
- 2
- Cited by