Degrees giving independent edges in a hypergraph

DOI10.1017/S0004972700006924zbMath0442.05050MaRDI QIDQ3884144

David E. Daykin, Roland Haeggkvist

Publication date: 1981

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

independent edges; r-partite hypergraph; degree of a hypergraph

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C65: Hypergraphs

Related Items

d-matching in k-uniform hypergraphs, Unnamed Item, Exact Minimum Codegree Threshold for K⁻₄-Factors, Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs, A geometric theory for hypergraph matching, Perfect matchings in 3-partite 3-uniform hypergraphs, Constrained completion of partial Latin squares, Nonnegative \(k\)-sums, fractional covers, and probability of small deviations, Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels, Exact minimum degree thresholds for perfect matchings in uniform hypergraphs, Polynomial-time perfect matchings in dense hypergraphs, Note on matchings in 3-partite 3-uniform hypergraphs, Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees, Packing \(k\)-partite \(k\)-uniform hypergraphs, Perfect matchings in 4-uniform hypergraphs, Hamilton \(\ell \)-cycles in uniform hypergraphs, Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs, \(d\)-matching in 3-uniform hypergraphs, Avoiding pairs of partial Latin squares, The Erdős matching conjecture and concentration inequalities, A multipartite Hajnal-Szemerédi theorem, Fractional and integer matchings in uniform hypergraphs, Unnamed Item, Unnamed Item, Permanents of multidimensional matrices: Properties and applications, Embedding Graphs into Larger Graphs: Results, Methods, and Problems

Cites Work

• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH