Degrees giving independent edges in a hypergraph
From MaRDI portal
Publication:3884144
DOI10.1017/S0004972700006924zbMath0442.05050MaRDI QIDQ3884144
Publication date: 1981
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
Related Items (27)
Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs ⋮ Fractional and integer matchings in uniform hypergraphs ⋮ The Erdős matching conjecture and concentration inequalities ⋮ Packing \(k\)-partite \(k\)-uniform hypergraphs ⋮ Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs ⋮ Perfect matchings in 3-partite 3-uniform hypergraphs ⋮ \(d\)-matching in 3-uniform hypergraphs ⋮ Constrained completion of partial Latin squares ⋮ Perfect matchings in 4-uniform hypergraphs ⋮ Nonnegative \(k\)-sums, fractional covers, and probability of small deviations ⋮ Permanents of multidimensional matrices: Properties and applications ⋮ d-matching in k-uniform hypergraphs ⋮ Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels ⋮ Exact minimum degree thresholds for perfect matchings in uniform hypergraphs ⋮ Unnamed Item ⋮ Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees ⋮ Exact Minimum Codegree Threshold for K−4-Factors ⋮ Polynomial-time perfect matchings in dense hypergraphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Note on matchings in 3-partite 3-uniform hypergraphs ⋮ Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Avoiding pairs of partial Latin squares ⋮ Hamilton \(\ell \)-cycles in uniform hypergraphs ⋮ A geometric theory for hypergraph matching ⋮ A multipartite Hajnal-Szemerédi theorem
Cites Work
This page was built for publication: Degrees giving independent edges in a hypergraph
