Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T11:12:27.836Z Has data issue: false hasContentIssue false

Degrees giving independent edges in a hypergraph

Published online by Cambridge University Press:  17 April 2009

David E. Daykin
Affiliation:
Department of Mathematics, University of Reading, Whiteknights, Reading, Berkshire RG6 2AX, England
Roland Häggkvist
Affiliation:
Institut Mittag-Leffler, Auravägen 17, S-182 62 Djursholm, Sweden.
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.

For r-partite and for r-uniform hypergraphs bounds are given for the minimum degree which ensures d independent edges.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1981