No CrossRef data available.
Article contents
On r-graphs and r-multihypergraphs with given maximum degree
Published online by Cambridge University Press: 09 April 2009
Abstract
It is well-known that if G is a multigraph (that is, a graph with multiple edges), the maximum number of pairwise disjoint edges in G is ν(G) and its maximum degree is D(G), then |E(G)| ≤ ν [3D/2’. We extend this theorem for r-graphs (that is, families of r-element sets) and for r-multihypergraphs (that is, r-graphs with repeated edges). Several problems remain open.
MSC classification
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 1991