Hostname: page-component-7b7567c8c-8p88z Total loading time: 0 Render date: 2026-11-19T13:29:33.425Z Has data issue: false hasContentIssue false

On r-graphs and r-multihypergraphs with given maximum degree

Published online by Cambridge University Press:  09 April 2009

Zoltán Füredi
Affiliation:
Mathematical InstituteHungarian Academy of Sciences 1364 Budapest POB 127, Hungary
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1991