Degrees giving independent edges in a hypergraph

1981/02/01 by David E. Daykin, D. E. Daykin, Roland Häggkvist · 8 citations
Mathematics · Computer Science · #Graph theory and applications #Limits and Structures in Graph Theory #Advanced Graph Theory Research

paper · pdf · doi:10.1017/s0004972700006924

Abstract

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

Cited by

• Loose Hamiltonicity
• Hamiltonicity in randomly perturbed hypergraphs
• Extremal Families for the Erdős--Kleitman Problem: The Missing Constructions
• Large Y_k,b -tilings and Hamilton ℓ -cycles in k-uniform hypergraphs
• Nonnegative k-sums, fractional covers, and probability of small\n deviations
• The Erd\Hos Matching Conjecture and concentration inequalities
• A multipartite version of the Hajnal-Szemer 'edi theorem for graphs and\n hypergraphs
• Perfect tilings with the generalised triangle in k-graphs

Related

• Degrees in oriented hypergraphs and sparse Ramsey theory
• On independent sets in uncrowded uniform hypergraphs
• Note on set representation of bounded degree hypergaphs
• An Efficiently Computable Lower Bound for the Independence Number of Hypergraphs
• Uniformity-independent minimum degree conditions for perfect matchings in hypergraphs