Pages that link to "Item:Q891826"

The following pages link to Packing \(k\)-partite \(k\)-uniform hypergraphs (Q891826):

Displaying 19 items.

• Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs (Q516075) (← links)
• Covering and tiling hypergraphs with tight cycles (Q1689974) (← links)
• Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles (Q2195224) (← links)
• The complexity of perfect matchings and packings in dense hypergraphs (Q2284737) (← links)
• Codegree threshold for tiling \(k\)-graphs with two edges sharing exactly \(\ell\) vertices (Q2287773) (← links)
• Tiling multipartite hypergraphs in quasi-random hypergraphs (Q2692780) (← links)
• Codegree Thresholds for Covering 3-Uniform Hypergraphs (Q2826217) (← links)
• (Q2857424) (← links)
• On Perfect Matchings and Tilings in Uniform Hypergraphs (Q4638614) (← links)
• Triangle-degrees in graphs and tetrahedron coverings in 3-graphs (Q4993257) (← links)
• Covering and tiling hypergraphs with tight cycles (Q4993263) (← links)
• Shadows of 3-Uniform Hypergraphs under a Minimum Degree Condition (Q5043057) (← links)
• Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles (Q5222560) (← links)
• Tight Minimum Degree Condition for the Existence of Loose Cycle Tilings in 3-Graphs (Q5238742) (← links)
• An Asymptotic Multipartite Kühn--Osthus Theorem (Q5275440) (← links)
• Minimum Codegree Threshold for<i>C</i>₆³-Factors in 3-Uniform Hypergraphs (Q5366961) (← links)
• Exact Minimum Codegree Threshold for <i>K</i>⁻₄-Factors (Q5373833) (← links)
• A geometric theory for hypergraph matching (Q5497101) (← links)
• Network Capacity Bound for Personalized PageRank in Multimodal Networks (Q6094516) (← links)