Pages that link to "Item:Q2874094"

The following pages link to Tiling 3-Uniform Hypergraphs With K43−2e (Q2874094):

Displaying 21 items.

• Perfect packings in quasirandom hypergraphs. I. (Q273176) (← links)
• Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs (Q516075) (← links)
• Packing \(k\)-partite \(k\)-uniform hypergraphs (Q891826) (← links)
• Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles (Q2195224) (← links)
• Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs (Q2258905) (← links)
• Codegree threshold for tiling \(k\)-graphs with two edges sharing exactly \(\ell\) vertices (Q2287773) (← links)
• \(F\)-factors in hypergraphs via absorption (Q2345534) (← links)
• Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs (Q2349508) (← links)
• Codegree Thresholds for Covering 3-Uniform Hypergraphs (Q2826217) (← links)
• Tight Co-Degree Condition for Packing of Loose Cycles in 3-Graphs (Q2833250) (← links)
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
• On Perfect Matchings and Tilings in Uniform Hypergraphs (Q4638614) (← links)
• Triangle-degrees in graphs and tetrahedron coverings in 3-graphs (Q4993257) (← 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)
• Minimum Vertex Degree Threshold for ‐tiling* (Q5265336) (← links)
• Perfect Packings in Quasirandom Hypergraphs II (Q5366906) (← 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)
• Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs (Q6081575) (← links)
• Large \(Y_{3,2}\)-tilings in 3-uniform hypergraphs (Q6568850) (← links)