Abstract
For r-partite and for r-uniform hypergraphs bounds are given for the minimum degree which ensures d independent edges. © 1981, Australian Mathematical Society. All rights reserved.
Cite
CITATION STYLE
APA
Daykin, D. E., & Häggkvist, R. (1981). Degrees giving independent edges in a hypergraph. Bulletin of the Australian Mathematical Society, 23(1), 103–109. https://doi.org/10.1017/S0004972700006924
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free